Foundations

Multi-Pass Memory Lower Bounds for Learning Problems COLT 2025 Multi-Shape Matching with Cycle Consistency Basis via Functional Maps AAAI 2025 Near-optimal algorithms for private estimation and sequential testing of collision probability AISTATS 2025 Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems ICML 2025 Near-Optimal Decision Trees in a SPLIT Second ICML 2025 Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration WACV 2025 New Algorithms for #2-SAT and #3-SAT IJCAI 2025 Noisy Computing of the Threshold Function ALT 2025 Noisy Group Testing in the Linear Regime: Exact Thresholds and Efficient COLT 2025 Non-Monetary Mechanism Design without Distributional Information: Using Scarce Audits Wisely (Extended Abstract) COLT 2025 NuMDS: An Efficient Local Search Algorithm for Minimum Dominating Set Problem IJCAI 2025 On Distributional Discrepancy for Experimental Design with General Assignment Probabilities AISTATS 2025 OneBatchPAM: A Fast and Frugal K-Medoids Algorithm AAAI 2025 One for all and all for one: Efficient computation of partial Wasserstein distances on the line ICLR 2025 Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025 ONLINE EPSILON NET & PIERCING SET FOR GEOMETRIC CONCEPTS ICLR 2025 On Mitigating Affinity Bias through Bandits with Evolving Biased Feedback ICML 2025 On the Computational Tractability of the (Many) Shapley Values AISTATS 2025 On the Modelling of Constraints with Tractable Logical Operators AAAI 2025 On the Power of Learning-Augmented Search Trees ICML 2025 On the Recovery of Cameras from Fundamental Matrices ICCV 2025 On Tractability of Learning Bayesian Networks with Ancestral Constraints AISTATS 2025 On Tradeoffs in Learning-Augmented Algorithms AISTATS 2025 Optimal Capacity Modification for Stable Matchings with Ties IJCAI 2025 Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs COLT 2025