Algorithms

Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions AAAI 2025 Lower Bounds for Greedy Teaching Set Constructions COLT 2025 Maintaining Proportional Committees with Dynamic Candidate Sets ICML 2025 Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs AAAI 2025 Matrix-Free Shared Intrinsics Bundle Adjustment CVPR 2025 Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures ICML 2025 Metric Embeddings Beyond Bi-Lipschitz Distortion via Sherali-Adams COLT 2025 Minimalistic Predictions for Online Class Constraint Scheduling ICLR 2025 Modeling Vowel System Typology Using Iterated Confusion Minimization Interspeech 2025 Multi-Agent Corridor Generating Algorithm IJCAI 2025 Multi-Pass Memory Lower Bounds for Learning Problems COLT 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 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