Efficient Testing without Efficient Regularity

A Complexity Trichotomy for $k$-Regular Asymmetric Spin Systems Using Number Theory

Towards a Unified Complexity Theory of Total Functions

Local decoding and testing of polynomials over grids

Limits for Rumor Spreading in stochastic populations

Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity

Making Asynchronous Distributed Computations Robust to Noise

On Price versus Quality

Pseudorandom Generators for Low Sensitivity Functions

Non-Negative Sparse Regression and Column Subset Selection with $L_1$ Error

Pseudo-Deterministic Proofs

Computing exact minimum cuts without knowing the graph

A Complete Characterization of Unitary Quantum Space

Approximate Clustering with Same-Cluster Queries

Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs

Information Value of the Game

Scheduling with Explorable Uncertainty

A Local-Search Algorithm for Steiner Forest

Learning Discrete Distributions from Untrusted Batches

Recovering Structured Probability Matrices

Zero-Knowledge Proofs of Proximity

Learning Dynamics and the Co-Evolution of Competing Sexual Species

Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness

Matrix Completion and Related Problems via Strong Duality

A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma

Long-term Memory and the Densest K-Subgraph Problem

Proofs of Proximity for Distribution Testing

A Quasi-Random Approach to Matrix Spectral Analysis

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity

Relaxed Locally Correctable Codes

Selection Problems in the Presence of Implicit Bias

Distance-preserving graph contractions

An Axiomatic Study of Scoring Rule Markets

Simple doubly-efficient interactive proof systems for locally-characterizable sets

Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds

Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning

Stabbing Planes

Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory

Graph Clustering using Effective Resistance

Barriers for Rank Methods in Arithmetic Complexity

A Candidate for a Strong Separation of Information and Communication

Learning by Refuting

Differential Privacy on Finite Computers

Fine-grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy

Edge Estimation with Independent Set Oracles

Competing bandits: learning under competition

Foundations of Homomorphic Secret Sharing

Minimum Circuit Size, Graph Isomorphism, and Related Problems

Further limitations of the known approaches for matrix multiplication

Quantum Query Algorithms are Completely Bounded Forms

Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice Case

Finite Sample Differentially Private Confidence Intervals

Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method

Toward a Theory of Markov Influence Systems and their Renormalization

ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network

Convergence Results for Neural Networks via Electrodynamics

Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers

Lattice-Based Locality Sensitive Hashing is Optimal

Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs