| 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 | 38* | 2019 |
| Minimum Manhattan network is NP-complete FYL Chin, Z Guo, H Sun Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009 | 35 | 2009 |
| Randomly punctured reed-solomon codes achieve the list decoding capacity over polynomial-size alphabets Z Guo, Z Zhang 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 21 | 2023 |
| Fast multivariate multipoint evaluation over all finite fields V Bhargava, S Ghosh, Z Guo, M Kumar, C Umans Journal of the ACM 71 (3), 1-32, 2024 | 19 | 2024 |
| Improved explicit hitting-sets for roabps Z Guo, R Gurjar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 19 | 2020 |
| Improved list-decodability and list-recoverability of Reed–Solomon codes via tree packings Z Guo, R Li, C Shangguan, I Tamo, M Wootters SIAM Journal on Computing 53 (2), 389-430, 2024 | 18 | 2024 |
| 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 | 17 | 2021 |
| A fast 2-approximation algorithm for the minimum Manhattan network problem Z Guo, H Sun, H Zhu Algorithmic Aspects in Information and Management: 4th International …, 2008 | 16 | 2008 |
| 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 | 15 | 2019 |
| Algebraic dependencies and PSPACE algorithms in approximative complexity Z Guo, N Saxena, A Sinhababu arXiv preprint arXiv:1801.09275, 2018 | 13 | 2018 |
| Greedy construction of 2-approximation minimum Manhattan network Z Guo, H Sun, H Zhu International Symposium on Algorithms and Computation, 4-15, 2008 | 13 | 2008 |
| 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 | 10 | 2011 |
| Extractors for images of varieties Z Guo, BL Volk, A Jalan, D Zuckerman Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 46-59, 2023 | 6 | 2023 |
| 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 | 6 | 2020 |
| 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 | 6 | 2016 |
| 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 | 6 | 2014 |
| Variety evasive subspace families Z Guo computational complexity 33 (2), 10, 2024 | 5 | 2024 |
| Random reed-solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets R Con, Z Guo, R Li, Z Zhang arXiv preprint arXiv:2407.07299, 2024 | 3 | 2024 |
| Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric Z Guo, C Xing, C Yuan, Z Zhang arXiv preprint arXiv:2404.13230, 2024 | 2 | 2024 |
| Deterministic polynomial factoring over finite fields: a uniform approach via P-schemes Z Guo Journal of Symbolic Computation 96, 22-61, 2020 | 2 | 2020 |
