Zeyu Guo
Zeyu Guo
Verified email at austin.utexas.edu - Homepage
Title
Cited by
Cited by
Year
Minimum Manhattan network is NP-complete
FYL Chin, Z Guo, H Sun
Discrete & Computational Geometry 45 (4), 701-722, 2011
302011
Derandomization from algebraic hardness: Treading the borders
Z Guo, M Kumar, R Saptharishi, N Solomon
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
172019
A fast 2-approximation algorithm for the minimum Manhattan network problem
Z Guo, H Sun, H Zhu
International Conference on Algorithmic Applications in Management, 212-223, 2008
152008
Algebraic dependencies and PSPACE algorithms in approximative complexity
Z Guo, N Saxena, A Sinhababu
arXiv preprint arXiv:1801.09275, 2018
122018
Greedy construction of 2-approximation minimum Manhattan network
Z Guo, H Sun, H Zhu
International Symposium on Algorithms and Computation, 4-15, 2008
112008
Greedy construction of 2-approximate minimum Manhattan networks
Z Guo, H Sun, H Zhu
International Journal of Computational Geometry & Applications 21 (03), 331-350, 2011
92011
Improved Explicit Hitting-Sets for ROABPs
Z Guo, R Gurjar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020
82020
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field
Z Guo, N Saxena, A Sinhababu
Theory of Computing 15 (1), 1-30, 2019
52019
Improved List-Decodability of Reed--Solomon Codes via Tree Packings
Z Guo, R Li, C Shangguan, I Tamo, M Wootters
arXiv preprint arXiv:2011.04453, 2020
42020
Gossip vs. markov chains, and randomness-efficient rumor spreading
Z Guo, H Sun
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
42014
Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields
Z Guo, AK Narayanan, C Umans
arXiv preprint arXiv:1606.04592, 2016
32016
Variety Evasive Subspace Families
Z Guo
arXiv preprint arXiv:2105.02908, 2021
22021
P-schemes and deterministic polynomial factoring over finite fields
Z Guo
California Institute of Technology, 2017
22017
Efficient list-decoding with constant alphabet and list sizes
Z Guo, N Ron-Zewi
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
12021
Deterministic polynomial factoring over finite fields: a uniform approach via P-schemes
Z Guo
Journal of Symbolic Computation 96, 22-61, 2020
12020
Derandomization from Algebraic Hardness*: A borderless version
Z Guo, M Kumar, R Saptharishi, N Solomon
12019
Randomness-efficient curve samplers
Z Guo
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
12013
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach
Z Guo
arXiv preprint arXiv:2007.00512, 2020
2020
-schemes and Deterministic Polynomial Factoring over Finite Fields
Z Guo
arXiv preprint arXiv:1706.10028, 2017
2017
Randomness-efficient Curve Sampling
Z Guo
California Institute of Technology, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–20