1: Almost 3-Approximate Correlation Clustering in Constant Rounds
2: Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs
3: Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
4: Online Algorithms with Multiple Predictions
5: Near-Optimal Deterministic Vertex-Failure Connectivity Oracles
6: Reusing Comparator Networks in Pseudo-Boolean Encodings
7: Improved Evaluation and Generation of Grid Layouts using Distance Preservation Quality and Linear Assignment Sorting
8: Edge Connectivity Augmentation in Near-Linear Time
9: Constant approximation for fault-tolerant median problems via iterative rounding
10: PaCHash: Packed and Compressed Hash Tables
11: Weisfeiler-Leman Invariant Promise Valued CSPs
12: Programming Data Structures for Large-Scale Desktop Simulations of Complex Systems
13: The spatial computer: A model for energy-efficient parallel computation
14: Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
15: FastHare: Fast Hamiltonian Reduction for Large-scale Quantum Annealing
16: TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
17: Prophet Inequality on I.I.D. Distributions: Beating 1-1/e with a Single Query
18: On Upward-Planar L-Drawings of Graphs
19: A New Class of String Transformations for Compressed Text Indexing
20: Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
21: An improved KTNS algorithm for the job sequencing and tool switching problem
22: Sequential algorithms for testing identity and closeness of distributions
23: Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
24: Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities
25: Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation
26: Balanced Allocations: The Heavily Loaded Case with Deletions
27: Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number
28: Global Convergence of Hessenberg Shifted QR II: Numerical Stability
29: Parameterized Complexity of Gerrymandering