Is it easier to count communities than find them?

Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly

Lifting to Parity Decision Trees Via Stifling

A subpolynomial-time algorithm for the free energy of one-dimensional...

An Algorithmic Bridge Between Hamming and Levenshtein Distances

An Improved Lower Bound for Matroid Intersection Prophet inequalities

Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations

The Strength of Equality Oracles in Communication

Private Counting of Distinct and k-Occurring Items in Time Windows

Clustering Permutations: New Techniques with Streaming Applications

Certificate games

Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence

Is This Correct? Let's Check!

New Lower Bounds and Derandomization for ACC, and a...

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field

The Complexity of Infinite-Horizon General-Sum Stochastic Games

Online Pen Testing

What Can Cryptography Do For Decentralized Mechanism Design?

Consensus Division in an Arbitrary Ratio

Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes

List Agreement Expansion from Coboundary Expansion

Quantum Proofs of Deletion for Learning with Errors

Differentially Private Continual Releases of Streaming Frequency Moment Estimations

Counting Subgraphs in Somewhere Dense Graphs

Is Untrusted Randomness Helpful?

Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique

Making Auctions Robust to Aftermarkets

Asynchronous Multi-Party Quantum Computation

Decision Making under Miscalibration - 8 minute