• The One-and-a-Half Johnson Bound is Tight for Proximity Gaps of General Linear Codes,

with Scott Duke Kominers and Justin Thaler [eprint].

• Algorithmic List Decoding of Reed--Solomon Codes up to Capacity,

with Joshua Brakensiek, Yeyuan Chen, Aaron Putterman, and Zihan Zhang [eccc].

• Improved Soundness for the Line-versus-Point Low Degree Test,

with Scott Duke Kominers and Justin Thaler [eccc].

• Zinc+: SNARKs for Polynomial Rings,

with Alexander Abdugafarov, Albert Garreta, Amit Kumar, Michał Osadnik, Psi Vesely, and Ilia Vlasov [eprint].

• Optimal Testing of Reed-Muller Codes with an Online Adversary,

with Esty Kelman and Uri Meir, [arxiv],

(CCC 2026).

• 3-Query RLDCs are Strictly Stronger than 3-Query LDCs, 

with Tom Gur, Dor Minzer, and Guy Weissenberg, [arxiv],

(STOC 2026).

• Near Optimal Hardness of Approximating k-CSP, 

with Dor Minzer, [arxiv],

(STOC 2026).

• Improved Round-by-round Soundness IOPs via Reed-Muller Codes, 

with Dor Minzer, [arxiv],

(FOCS 2025).

• New Direct Sum Tests,  

with Alek Westover and Edward Yu, [arxiv],

(ITCS 2025). [Hartley Rogers Jr. Prize @ MIT]

• Near Optimal Alphabet-Soundness Tradeoff PCPs, 

with Dor Minzer, [ECCC],

(STOC 2024 and invited to Journal of the ACM).

[STOC Best Paper Award], [Charles W. and Jennifer C. Johnson Prize @ MIT]

• Adversarial Low Degree Testing, 

with Dor Minzer, [arxiv],

(SODA 2024).

• Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries, 

with Dor Minzer, [arxiv],

(FOCS 2023).

• Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test,

with Dor Minzer, [arxiv],

(SODA 2023).

• On the e-positivity of trees and spiders, [arxiv],

(Journal of Combinatorial Theory, Series A).

• Stack-Sorting with Consecutive-Pattern-Avoiding Stacks, 

with Colin Defant, [arxiv],

(Advances in Applied Mathematics).

• Unitary Signings and Induced Subgraphs of Cayley Graphs of (ℤ_2)^n, 

with Noga Alon, [arxiv],

(Advances in Combinatorics).