I am a Ph.D. student at the department of Computing and Mathematical Sciences, Caltech, and a member of the Theory Group. At Caltech, I do research in theoretical computer science under the supervision of Professor Chris Umans.

My research interests include algebraic methods in theoretical computer science, pseudorandomness and its connections with coding theory, algorithms in number theory and algebra.

P-schemes: a unifying framework for deterministic polynomial factoring over finite fields (research summary)

Zeyu Guo, Anand Kumar Narayanan and Chris Umans. Algebraic Problems equivalent to beating the 3/2 exponent in Polynomial Factorization over Finite Fields. Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 47:1–47:14, 2016.

Zeyu Guo and He Sun. Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 411-430, 2015. Full version on arXiv.

Zeyu Guo. Randomness-Efficient Curve Samplers. Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM), page 575-590, 2013. Also ECCC TR13-120.

Francis Y. L. Chin, Zeyu Guo and He Sun. Minimum Manhattan Network is NP-Complete. Proceedings of the 25th Annual Symposium on Computational Geometry (SCG), pages 393-402, 2009. Journal version in Discrete and Computational Geometry 45(4): 701-722, 2011.

2016.08, The 41st International Symposium on Mathematical Foundations of Computer Science, Krakow, Poland

2015.07, The 12th International Conference on Finite Fields and Their Applications, Saratoga Springs, USA

2015.01, The 26th ACM-SIAM Symposium on Discrete Algorithms, San Diego, USA

2013.08, China Theory Week, Aarhus University, Denmark

2012.08, Max Planck Institute for Informatics, Saarbrücken, Germany

2009.06, The 25th Annual Symposium on Computational Geometry, Aarhus University, Denmark

2014 Spring, CS 38: Introduction to Algorithms

2013 Spring, CS 151: Complexity Theory

2012 Winter, CS 138: Computer Algorithms

Office: 332 Annenberg

Mailing Address:

MC 305-16, Caltech

1200 East California Boulevard

Pasadena, CA 91125