Algorithms

Rank-one matrix estimation: analytic time evolution of gradient descent dynamics COLT 2021 Rearrangement on Lattices with Swaps: Optimality Structures and Efficient Algorithms RSS 2021 Reconstructing weighted voting schemes from partial information about their power indices COLT 2021 Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility AAAI 2021 Reducing SAT to Max2SAT IJCAI 2021 Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem Interspeech 2021 Rejection Sampling for Weighted Jaccard Similarity Revisited AAAI 2021 Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes NeurIPS 2021 Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021 Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search (Extended Abstract) IJCAI 2021 Satisfiability and Algorithms for Non-uniform Random k-SAT AAAI 2021 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 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