Zeyu Guo
Postdoctoral Researcher
Dr. Zeyu Guo is a research fellow at the Department of Computer Science at UT Austin supervised by Professor David Zuckerman. His research interests include pseudorandomness, coding theory, algebraic complexity theory, and applications of algebraic methods in theoretical computer science. Much of his research is motivated by the following questions: How does randomness affect the power of computation? Can randomized algorithms be derandomized?
Research
Research Interests:
Pseudorandomness, coding theory, algebraic complexity theory, and applications of algebraic methods in theoretical computer science.
Select Publications
Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, and Mary Wootters. 2021. Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings.
Zeyu Guo. 2021. Variety Evasive Subspace Families. pages 20:1–20:33.
Zeyu Guo and Noga Ron-Zewi. 2021. Efficient List-Decoding with Constant Alphabet and List Sizes. pages 1502–1515.
Zeyu Guo. 2020. Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. pages 42:1-42:14.
Zeyu Guo and Rohit Gurjar. 2020. Improved Explicit Hitting-Sets for ROABPs. pages 4:1-4:16.
Awards & Honors
2013 -
Invited to participate in China Theory Week
2009 -
President’s Medal of Fudan University
2009 -
Wangdao Scholar
2008 -
Chun-Tsung Scholar
20005 -
Bronze Medal, National Olympiad in Informatics.
