1: On cap sets and the group-theoretic approach to matrix multiplication
2: A Polynomial Time Graph Isomorphism Algorithm For Graphs That Are Not Locally Triangle-Free
3: The Greedy Spanner is Existentially Optimal
4: A Sub-Quadratic Exact Medoid Algorithm
5: SONIK: Efficient In-situ All Item Rank Generation using Bit Operations
6: Isotropic Dynamic Hierarchical Clustering
7: Pure Exploration of Multi-armed Bandit Under Matroid Constraints
8: Submodular Maximization using Test Scores
9: Canonical Number and NutCracker: Heuristic Algorithms for the Graph Isomorphism Problem using Free Energy
10: Matrix Completion has No Spurious Local Minimum
11: Deterministic Time-Space Tradeoffs for k-SUM
12: Recursive Sampling for the Nystr"om Method
13: Parameterized complexity of fair deletion problems
14: Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks
15: Online Placement of Multi-Component Applications in Edge Computing Environments
16: Dominance Product and High-Dimensional Closest Pair under $L_\infty$
17: Towards large-scale deliberative decision-making: small groups and the importance of triads
18: Analysis of Resparsification
19: Faster Eigenvector Computation via Shift-and-Invert Preconditioning
20: A resource-frugal probabilistic dictionary and applications in (meta)genomics
21: Energy-Efficient Algorithms
22: A Simple and Strongly-Local Flow-Based Method for Cut Improvement
23: Induced Minor Free Graphs: Isomorphism and Clique-width
24: Maximum-expectation matching under recourse
25: Parameterized Resiliency Problems via Integer Linear Programming
26: Bridging the Capacity Gap Between Interactive and One-Way Communication
27: Greedy Column Subset Selection: New Bounds and Distributed Algorithms