Foundations

Saturated Post-hoc Optimization for Classical Planning AAAI 2021 Scaling Average-Linkage via Sparse Cluster Embeddings ACML 2021 Searching for More Efficient Dynamic Programs EMNLP 2021 Separable Four Points Fundamental Matrix WACV 2021 Sequential Random Sampling Revisited: Hidden Shuffle Method AISTATS 2021 Shape-Aware Multi-Person Pose Estimation From Multi-View Images ICCV 2021 Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model AAAI 2021 SMT-based Safety Checking of Parameterized Multi-Agent Systems AAAI 2021 Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints IJCAI 2021 Source Identification for Mixtures of Product Distributions COLT 2021 SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search NeurIPS 2021 Sparse sketches with small inversion bias COLT 2021 Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs COLT 2021 Splitting EUD Graphs into Trees: A Quick and Clatty Approach ACL 2021 Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent COLT 2021 Stochastic block model entropy and broadcasting on trees with survey COLT 2021 STORM: Refinement Types for Secure Web Applications OSDI 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