معرفی
Zeyu Guo is an Assistant Professor in the Department of Computer Science and Engineering at The Ohio State University, based in Dreese Laboratories, Columbus, Ohio. He earned his Ph.D. in Computer Science from the California Institute of Technology in 2017 under the supervision of Chris Umans, followed by postdoctoral appointments at the University of Texas at Austin, the University of Haifa (Israel), and the Indian Institute of Technology Kanpur (India).
Research Interests
- Theoretical Computer Science
- Computational Complexity
- Pseudorandomness and Derandomization
- Coding Theory
- Algebraic Complexity Theory
- Algebraic Algorithms
His work explores deep interplay between algebra and computation, designing efficient algorithms, constructing pseudorandom objects, and establishing fundamental limits in error-correcting codes.
Recent Publication Landscape
Across 2021-2025, Guo’s papers predominantly target list decoding capacity for Reed–Solomon and Gabidulin codes, polynomial identity testing for restricted circuit classes, and fast algebraic algorithms such as multivariate multipoint evaluation. A recurring theme is leveraging algebraic geometry and additive combinatorics to derandomize constructions and achieve optimal parameters.
Awards & Funding
- NSF CAREER Award (current support)
Advising & Mentoring
- PhD student: Zihan Zhang
- Postdoc mentee: Ashish Dwivedi (2023–2024)
Teaching & Course Development
Guo regularly teaches core graduate and undergraduate courses including Algorithms, Computability and Complexity, and specialized topics in algebraic complexity theory and error-correcting codes.
