Algorithms

Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021 Near-Optimal Algorithms for Explainable k-Medians and k-Means ICML 2021 Near Optimal Distributed Learning of Halfspaces with Two Parties COLT 2021 Near-Optimal Entrywise Sampling of Numerically Sparse Matrices COLT 2021 Objective-Based Hierarchical Clustering of Deep Embedding Vectors AAAI 2021 On Continuous Local BDD-Based Search for Hybrid SAT Solving AAAI 2021 Online Selection Problems against Constrained Adversary ICML 2021 Online Unrelated Machine Load Balancing with Predictions Revisited ICML 2021 On the Optimal Efficiency of A* with Dominance Pruning AAAI 2021 OPRA: An Open-Source Online Preference Reporting and Aggregation System AAAI 2021 Optimal Sketching for Trace Estimation NeurIPS 2021 Optimising Automatic Calibration of Electric Muscle Stimulation AAAI 2021 OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots AAAI 2021 Parallel Constraint Acquisition AAAI 2021 Parameterized Algorithms for MILPs with Small Treedepth AAAI 2021 Participatory Budgeting with Project Groups IJCAI 2021 Path Planning using Neural A* Search ICML 2021 Persuading Voters in District-based Elections AAAI 2021 PET: Optimizing Tensor Programs with Partially Equivalent Transformations and Automated Corrections OSDI 2021 Practical Near Neighbor Search via Group Testing NeurIPS 2021 Present-Biased Optimization AAAI 2021 Projection techniques to update the truncated SVD of evolving matrices with applications ICML 2021 Proportional Representation under Single-Crossing Preferences Revisited AAAI 2021 Putting the “Learning" into Learning-Augmented Algorithms for Frequency Estimation ICML 2021 Qualitative Spatial and Temporal Reasoning: Current Status and Future Challenges IJCAI 2021