Kai Zhe Zheng

Hello! I am a currently a Research Fellow at the Simons Institute for the Theory of Computing and will be a member at the IAS next year.

I received my PhD in Mathematics from MIT, where I was fortunate to be advised by Dor Minzer. I am interested in complexity theory, PCPs, Proof Systems, and combinatorics.

Previously, I received an A.B. in Mathematics at Princeton University. As an undergraduate I had the privilege of working with Noga Alon and Robert Tarjan, as well as Joe Gallian and Colin Defant at the Duluth REU.

If you are interested in any of my work feel free to reach out! kzzheng[at]mit.edu

Selected Publications

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

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

Zinc+: SNARKs for Polynomial Rings,

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

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

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

(STOC 2026).

Near Optimal Alphabet-Soundness Tradeoff PCPs,

with Dor Minzer, [ECCC],

(STOC 2024 and invited to Journal of the ACM). [STOC Best Paper Award], [Johnson Prize @ MIT]

Page updated

Google Sites

Report abuse