Algorithms

Stochastic block model entropy and broadcasting on trees with survey COLT 2021 Streaming and Distributed Algorithms for Robust Column Subset Selection ICML 2021 Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021 Surprisingly Popular Voting Recovers Rankings, Surprisingly! IJCAI 2021 Targeted Negative Campaigning: Complexity and Approximations AAAI 2021 The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood COLT 2021 The ensmallen library for flexible numerical optimization JMLR 2021 The Match-Extend serialization algorithm in Multiprecedence ACL 2021 The Parameterized Complexity of Clustering Incomplete Data AAAI 2021 The Power of Literal Equivalence in Model Counting AAAI 2021 The Sparse Vector Technique, Revisited COLT 2021 The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound IJCAI 2021 Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle COLT 2021 Towards More Practical and Efficient Automatic Dominance Breaking AAAI 2021 Unitary Branching Programs: Learnability and Lower Bounds ICML 2021 VSAC: Efficient and Accurate Estimator for H and F ICCV 2021 Winner Determination and Strategic Control in Conditional Approval Voting IJCAI 2021 Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments IJCAI 2021 A Cardinal Improvement to Pseudo-Boolean Solving AAAI 2020 Action Graphs for Goal Recognition Problems with Inaccurate Initial States (Student Abstract) AAAI 2020 Adapting Stable Matchings to Evolving Preferences AAAI 2020 Adaptive Probing Policies for Shortest Path Routing NeurIPS 2020 A determinantal point process for column subset selection JMLR 2020 A Game Theoretic Approach For Core Resilience IJCAI 2020 A Graduated Filter Method for Large Scale Robust Estimation CVPR 2020