Rate Amplification and Query-Efficient Distance Amplification for linear LCC and LDC

An Improved Protocol for the Exactly-$N$ Problem

Proof complexity of natural formulas via communication arguments

A Lower Bound on Determinantal Complexity

Optimal tiling of the Euclidean space using permutation-symmetric bodies

On the Power and Limitations of Branch and Cut

Separating ABPs and Some Structured Formulas in the Non-Commutative Setting

The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications

Shadows of Newton polytopes

Fractional Pseudorandom Generators from Any Fourier Level

Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing

Barriers for recent methods in geodesic optimization

Communication Complexity with Defective Randomness

On the cut dimension of a graph

On p-Group Isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors

Branching Programs with Bounded Repetitions and Flow Formulas

A Majority Lemma for Randomised Query Complexity

Hitting Sets and Reconstruction for Dense Orbits in VP and ΣΠΣ circuits

Variety Evasive Subspace Families

A Lower Bound for Polynomial Calculus with Extension Rule

Error Reduction For Weighted PRGs Against Read Once Branching Programs

A Stress-Free Sum-of-Squares Lower Bound for Coloring

Junta Distance Approximation with Sub-Exponential Queries

Arithmetic Circuit Complexity of Division and Truncation

SOS lower bound for exact planted clique

A Direct Product Theorem for One-Way Quantum Communication

Quantum complexity of minimum cut

On the complexity of evaluating highest weight vectors

On Query-to-Communication Lifting for Adversary Bounds

Hardness of Constant-round Communication Complexity

Polynomial time algorithms in invariant theory for torus actions

Pseudodistributions That Beat All Pseudorandom Generators

GSF-locality is not sufficient for proximity-oblivious testing

Hardness of KT Characterizes Parallel Cryptography

On the Pseudo-deterministic Query Complexity of NP Search Problems

A Simple Proof of a New Set Disjointness with Applications to Data Streams

Toward better depth lower bounds: the XOR-KRW conjecture

Fourier Growth of Parity Decision Trees

The Power of Negative Reasoning

Matrix rigidity depends on the target field