default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZeyu Guo 0001
Person information
- affiliation: Ohio State University, Columbus, OH, USA
Other persons with the same name
- Zeyu Guo 0002
![[0009-0000-7662-8476]](https://dblp.org/img/orcid-mark.12x12.png "0009-0000-7662-8476")
— Institute of Microelectronics, Chinese Academy of Sciences, Beijing, China - Zeyu Guo 0003 — Institute of Optics and Electronics, Chinese Academy of Sciences, Chengdu, China
- Zeyu Guo 0004 — Southeast University, Nanjing, China
- Zeyu Guo 0005 — University of New South Wales, School of Mathematics and Statistics, Sydney, NSW, Australia
- Zeyu Guo 0006 — Liaoning Petrochemical University, China
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i26]Zhaienhe Zhou, Zeyu Guo:
Improved Decoding of Tanner Codes. CoRR abs/2501.12293 (2025)- 2024
- [j9]Zeyu Guo:
Variety Evasive Subspace Families. Comput. Complex. 33(2): 10 (2024) - [j8]Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation over All Finite Fields. J. ACM 71(3): 22 (2024) - [j7]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. 53(2): 389-430 (2024) - [c19]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. APPROX/RANDOM 2024: 41:1-41:24 - [c18]Ashish Dwivedi, Zeyu Guo, Ben Lee Volk:
Optimal Pseudorandom Generators for Low-Degree Polynomials over Moderately Large Fields. APPROX/RANDOM 2024: 44:1-44:19 - [c17]Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. FOCS 2024: 1846-1873 - [i25]Ashish Dwivedi, Zeyu Guo, Ben Lee Volk:
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. CoRR abs/2402.11915 (2024) - [i24]Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR abs/2404.13230 (2024) - [i23]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. CoRR abs/2405.10277 (2024) - [i22]Roni Con, Zeyu Guo, Ray Li, Zihan Zhang:
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. CoRR abs/2407.07299 (2024) - [i21]Ashish Dwivedi, Zeyu Guo, Ben Lee Volk:
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. Electron. Colloquium Comput. Complex. TR24 (2024) - [i20]Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan:
Hilbert Functions and Low-Degree Randomness Extractors. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c16]Zeyu Guo, Zihan Zhang:
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. FOCS 2023: 164-176 - [c15]Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman:
Extractors for Images of Varieties. STOC 2023: 46-59 - [i19]Zeyu Guo, Zihan Zhang:
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. CoRR abs/2304.01403 (2023) - 2022
- [j6]Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness. SIAM J. Comput. 51(2): 315-335 (2022) - [j5]Zeyu Guo, Noga Ron-Zewi:
Efficient List-Decoding With Constant Alphabet and List Sizes. IEEE Trans. Inf. Theory 68(3): 1663-1682 (2022) - [c14]Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation Over All Finite Fields. FOCS 2022: 221-232 - [i18]Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation Over All Finite Fields. CoRR abs/2205.00342 (2022) - [i17]Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman:
Extractors for Images of Varieties. CoRR abs/2211.14497 (2022) - [i16]Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans:
Fast Multivariate Multipoint Evaluation Over All Finite Fields. Electron. Colloquium Comput. Complex. TR22 (2022) - [i15]Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman:
Extractors for Images of Varieties. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c13]Zeyu Guo:
Variety Evasive Subspace Families. CCC 2021: 20:1-20:33 - [c12]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS 2021: 708-719 - [c11]Zeyu Guo, Noga Ron-Zewi:
Efficient list-decoding with constant alphabet and list sizes. STOC 2021: 1502-1515 - [i14]Zeyu Guo:
Variety Evasive Subspace Families. CoRR abs/2105.02908 (2021) - [i13]Zeyu Guo:
Variety Evasive Subspace Families. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j4]Zeyu Guo:
Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes. J. Symb. Comput. 96: 22-61 (2020) - [c10]Zeyu Guo, Rohit Gurjar:
Improved Explicit Hitting-Sets for ROABPs. APPROX-RANDOM 2020: 4:1-4:16 - [c9]Zeyu Guo:
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. MFCS 2020: 42:1-42:14 - [i12]Zeyu Guo:
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. CoRR abs/2007.00512 (2020) - [i11]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR abs/2011.04453 (2020) - [i10]Zeyu Guo, Noga Ron-Zewi:
Efficient List-Decoding with Constant Alphabet and List Sizes. CoRR abs/2011.05884 (2020) - [i9]Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters:
Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. TR20 (2020) - [i8]Zeyu Guo, Noga Ron-Zewi:
Efficient List-Decoding with Constant Alphabet and List Sizes. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j3]Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. Theory Comput. 15: 1-30 (2019) - [c8]Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. FOCS 2019: 147-157 - 2018
- [c7]Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. CCC 2018: 10:1-10:21 - [i7]Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic dependencies and PSPACE algorithms in approximative complexity. CoRR abs/1801.09275 (2018) - [i6]Zeyu Guo, Nitin Saxena, Amit Sinhababu:
Algebraic dependencies and PSPACE algorithms in approximative complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Zeyu Guo:
P-Schemes and Deterministic Polynomial Factoring Over Finite Fields. California Institute of Technology, USA, 2017 - [i5]Zeyu Guo:
𝒫-schemes and Deterministic Polynomial Factoring over Finite Fields. CoRR abs/1706.10028 (2017) - 2016
- [c6]Zeyu Guo, Anand Kumar Narayanan, Chris Umans:
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. MFCS 2016: 47:1-47:14 - [i4]Zeyu Guo, Anand Kumar Narayanan, Chris Umans:
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. CoRR abs/1606.04592 (2016) - 2015
- [c5]Zeyu Guo, He Sun:
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. SODA 2015: 411-430 - 2013
- [c4]Zeyu Guo:
Randomness-Efficient Curve Samplers. APPROX-RANDOM 2013: 575-590 - [i3]Zeyu Guo:
Randomness-efficient Curve Samplers. CoRR abs/1309.1089 (2013) - [i2]Zeyu Guo, He Sun:
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. CoRR abs/1311.2839 (2013) - [i1]Zeyu Guo:
Randomness-efficient Curve Samplers. Electron. Colloquium Comput. Complex. TR13 (2013) - 2011
- [j2]Francis Y. L. Chin, Zeyu Guo, He Sun:
Minimum Manhattan Network is NP-Complete. Discret. Comput. Geom. 45(4): 701-722 (2011) - [j1]Zeyu Guo, He Sun, Hong Zhu:
Greedy Construction of 2-Approximate Minimum Manhattan Networks. Int. J. Comput. Geom. Appl. 21(3): 331-350 (2011)
2000 – 2009
- 2009
- [c3]Francis Y. L. Chin, Zeyu Guo, He Sun:
Minimum Manhattan network is NP-complete. SCG 2009: 393-402 - 2008
- [c2]Zeyu Guo, He Sun, Hong Zhu:
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. AAIM 2008: 212-223 - [c1]Zeyu Guo, He Sun, Hong Zhu:
Greedy Construction of 2-Approximation Minimum Manhattan Network. ISAAC 2008: 4-15
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-18 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
