A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. - Zeyu Guo 001; He Sun 001; Hong Zhu 004 (AAIM, 2008)

Greedy Construction of 2-Approximation Minimum Manhattan Network. - Zeyu Guo 001; He Sun 001; Hong Zhu 004 (ISAAC, 2008)

Minimum Manhattan Network is NP-Complete. - Francis Y. L. Chin; Zeyu Guo 001; He Sun 001 (Discret. Comput. Geom., 2011)

Greedy Construction of 2-Approximate Minimum Manhattan Networks. - Zeyu Guo 001; He Sun 001; Hong Zhu 004 (Int. J. Comput. Geom. Appl., 2011)

Randomness-efficient Curve Samplers. - Zeyu Guo 001 (Electron. Colloquium Comput. Complex., 2013)

Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. - Zeyu Guo 001; He Sun 001 (SODA, 2015)

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. - Zeyu Guo 001; Anand Kumar Narayanan; Chris Umans (MFCS, 2016)

𝒫-schemes and Deterministic Polynomial Factoring over Finite Fields. - Zeyu Guo 001 (CoRR, 2017)

P-Schemes and Deterministic Polynomial Factoring Over Finite Fields. - Zeyu Guo 001 (2017)

Algebraic dependencies and PSPACE algorithms in approximative complexity. - Zeyu Guo 001; Nitin Saxena 001; Amit Sinhababu (Electron. Colloquium Comput. Complex., 2018)

Derandomization from Algebraic Hardness: Treading the Borders. - Zeyu Guo 001; Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (FOCS, 2019)

Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. - Zeyu Guo 001; Nitin Saxena 001; Amit Sinhababu (Theory Comput., 2019)

Improved Explicit Hitting-Sets for ROABPs. - Zeyu Guo 001; Rohit Gurjar (APPROX-RANDOM, 2020)

Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. - Zeyu Guo 001 (MFCS, 2020)

Improved List-Decodability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (Electron. Colloquium Comput. Complex., 2020)

Efficient List-Decoding with Constant Alphabet and List Sizes. - Zeyu Guo 001; Noga Ron-Zewi (Electron. Colloquium Comput. Complex., 2020)

Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes. - Zeyu Guo 001 (J. Symb. Comput., 2020)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (FOCS, 2021)

Fast Multivariate Multipoint Evaluation Over All Finite Fields. - Vishwas Bhargava; Sumanta Ghosh; Zeyu Guo 001; Mrinal Kumar 001; Chris Umans (Electron. Colloquium Comput. Complex., 2022)

Extractors for Images of Varieties. - Zeyu Guo 001; Ben Lee Volk; Akhil Jalan; David Zuckerman (Electron. Colloquium Comput. Complex., 2022)

Derandomization from Algebraic Hardness. - Zeyu Guo 001; Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (SIAM J. Comput., 2022)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. - Zeyu Guo 001; Zihan Zhang 001 (FOCS, 2023)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. - Zeyu Guo 001; Chaoping Xing; Chen Yuan 003; Zihan Zhang 001 (FOCS, 2024)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. - Ashish Dwivedi; Zeyu Guo 001; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2024)

Hilbert Functions and Low-Degree Randomness Extractors. - Alexander Golovnev; Zeyu Guo 001; Pooya Hatami; Satyajeet Nagargoje; Chao Yan (Electron. Colloquium Comput. Complex., 2024)

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. - Zeyu Guo 001; Ray Li; Chong Shangguan; Itzhak Tamo; Mary Wootters (SIAM J. Comput., 2024)

Variety Evasive Subspace Families. - Zeyu Guo 001 (Comput. Complex., 2024)

Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio. - Zeyu Guo 001; Chaoping Xing; Chen Yuan 003; Zihan Zhang 001 (APPROX/RANDOM, 2025)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. - Roni Con; Zeyu Guo 001; Ray Li; Zihan Zhang 001 (ICALP, 2025)

Deterministic Depth-4 PIT and Normalization. - Zeyu Guo 001; Siki Wang (Electron. Colloquium Comput. Complex., 2025)

Improved Decoding of Tanner Codes. - Zhaienhe Zhou; Zeyu Guo 001 (CoRR, 2025)