Scholar
Zeyu Guo
Google Scholar ID: vHFcofYAAAAJ
The Ohio State University
Citations & Impact
Citations
251
H-index
8
i10-index
7
Publications
20
Co-authors
0
Publications
Resume (English only)
Academic Achievements
- Debordering Closure Results in Determinantal and Pfaffian Ideals, to appear in ITCS 2026.
- Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets, Advances in Combinatorics, 2025.
- Deterministic Depth-4 PIT and Normalization, Manuscript, also available on ECCC and arXiv.
- Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio, RANDOM 2025.
- Improved Decoding of Tanner Codes, ISIT 2025, also available on arXiv.
- Random Reed–Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets, ICALP 2025, also available on arXiv.
- Hilbert Functions and Low-Degree Randomness Extractors, RANDOM 2024, also available on ECCC and arXiv.
- Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields, RANDOM 2024, also available on ECCC and arXiv.
- Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric, FOCS 2024, also available on arXiv.
- Randomly Punctured Reed–Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets, FOCS 2023, also available on arXiv.
- Extractors for Images of Varieties, STOC 2023, also available on ECCC and arXiv.
- Fast Multivariate Multipoint Evaluation Over All Finite Fields, FOCS 2022, also available on ECCC and arXiv, journal version in the Journal of the ACM, 2024.
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings, FOCS 2021, journal version in SIAM Journal on Computing, 2024.
- Variety Evasive Subspace Families, computational complexity, 2024, a previous version appears in CCC 2021, also available on ECCC and arXiv.
Research Experience
- Assistant Professor in the Department of Computer Science and Engineering at The Ohio State University. Postdocs at UT Austin, University of Haifa, and IIT Kanpur.
Education
- Ph.D. in Computer Science from Caltech in 2017, under Chris Umans.
Background
- Research interests include pseudorandomness, coding theory, algebraic complexity theory, and applications of algebraic methods in theoretical computer science.
Co-authors