Zeyu Guo

According to our database, Zeyu Guo authored at least 31 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Deterministic Depth-4 PIT and Normalization.

Zeyu Guo, Siki Wang

Electron. Colloquium Comput. Complex., 2025

Improved Decoding of Tanner Codes.

Zhaienhe Zhou, Zeyu Guo

Proceedings of the IEEE International Symposium on Information Theory, 2025

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets.

Roni Con, Zeyu Guo, Ray Li, Zihan Zhang

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio.

Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang

Proceedings of the Approximation, 2025

2024

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings.

Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters

SIAM J. Comput., 2024

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric.

Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Hilbert Functions and Low-Degree Randomness Extractors.

Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan

Proceedings of the Approximation, 2024

Optimal Pseudorandom Generators for Low-Degree Polynomials over Moderately Large Fields.

Ashish Dwivedi, Zeyu Guo, Ben Lee Volk

Proceedings of the Approximation, 2024

2023

Extractors for Images of Varieties.

Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets.

Zeyu Guo, Zihan Zhang

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Derandomization from Algebraic Hardness.

Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon

SIAM J. Comput., 2022

Fast Multivariate Multipoint Evaluation Over All Finite Fields.

Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Efficient list-decoding with constant alphabet and list sizes.

Zeyu Guo, Noga Ron-Zewi

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract].

Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Variety Evasive Subspace Families.

Zeyu Guo

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes.

Zeyu Guo

J. Symb. Comput., 2020

Improved List-Decodability of Reed-Solomon Codes via Tree Packings.

Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters

Electron. Colloquium Comput. Complex., 2020

Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach.

Zeyu Guo

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Improved Explicit Hitting-Sets for ROABPs.

Zeyu Guo, Rohit Gurjar

Proceedings of the Approximation, 2020

2019

Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field.

Zeyu Guo, Nitin Saxena, Amit Sinhababu

Theory Comput., 2019

Derandomization from Algebraic Hardness: Treading the Borders.

Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity.

Zeyu Guo, Nitin Saxena, Amit Sinhababu

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

P-Schemes and Deterministic Polynomial Factoring Over Finite Fields.

Zeyu Guo

PhD thesis, 2017

𝒫-schemes and Deterministic Polynomial Factoring over Finite Fields.

Zeyu Guo

CoRR, 2017

2016

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields.

Zeyu Guo, Anand Kumar Narayanan, Chris Umans

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading.

Zeyu Guo, He Sun

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2013

Randomness-Efficient Curve Samplers.

Zeyu Guo

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2011

Greedy Construction of 2-Approximate Minimum Manhattan Networks.

Zeyu Guo, He Sun, Hong Zhu

Int. J. Comput. Geom. Appl., 2011

2009

Minimum Manhattan network is NP-complete.

Francis Y. L. Chin, Zeyu Guo, He Sun

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Greedy Construction of 2-Approximation Minimum Manhattan Network.

Zeyu Guo, He Sun, Hong Zhu

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem.

Zeyu Guo, He Sun, Hong Zhu

Proceedings of the Algorithmic Aspects in Information and Management, 2008