We stand with Ukraine  

Kai Zhe Zheng

Orcid: 0000-0002-0436-8131

Affiliations:
  • Massachusetts Institute of Technology, Department of Mathematics, Cambridge, MA, USA


According to our database1, Kai Zhe Zheng authored at least 9 papers between 2023 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Optimal Testing of Reed-Muller Codes with an Online Adversary.
[BibTeX]
[DOI]
Esty Kelman
,
Uri Meir
,
Kai Zhe Zheng
CoRR, May, 2026

Near Optimal Hardness of Approximating k-CSP.
[BibTeX]
[DOI]
Dor Minzer
,
Kai Zhe Zheng
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs.
[BibTeX]
[DOI]
Tom Gur
,
Dor Minzer
,
Guy Weissenberg
,
Kai Zhe Zheng
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
Near Optimal Hardness of Approximating <i>k</i>-CSP.
[BibTeX]
[DOI]
Dor Minzer
,
Kai Zhe Zheng
CoRR, October, 2025

New Direct Sum Tests.
[BibTeX]
[DOI]
Alek Westover
,
Edward Yu
,
Kai Zhe Zheng
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Improved Round-by-round Soundness IOPs via Reed-Muller Codes.
[BibTeX]
[DOI]
Dor Minzer
,
Kai Zhe Zheng
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024
Near Optimal Alphabet-Soundness Tradeoff PCPs.
[BibTeX]
[DOI]
Dor Minzer
,
Kai Zhe Zheng
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Adversarial Low Degree Testing.
[BibTeX]
[DOI]
Dor Minzer
,
Kai Zhe Zheng
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries.
[BibTeX]
[DOI]
Dor Minzer
,
Kai Zhe Zheng
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023


  Loading...