Zeyu Guo - RankMe

62 papers A* 9A 6B 4C 1Journal 38Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Debordering Closure Results in Determinantal and Pfaffian Ideals. ITCS Anakin Dey, Zeyu Guo
2025	J	`jnl`	Debordering Closure Results in Determinantal and Pfaffian Ideals. CoRR Anakin Dey, Zeyu Guo
2025	J	`jnl`	Debordering Closure Results in Determinantal and Pfaffian Ideals. Electron. Colloquium Comput. Complex. Anakin Dey, Zeyu Guo
2025	J	`jnl`	Deterministic Depth-4 PIT and Normalization. CoRR Zeyu Guo, Siki Wang
2025	J	`jnl`	Deterministic Depth-4 PIT and Normalization. Electron. Colloquium Comput. Complex. Zeyu Guo, Siki Wang
2025	A	`conf`	Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row Ratio. APPROX/RANDOM Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
2025	B	`conf`	Improved Decoding of Tanner Codes. ISIT Zhaienhe Zhou, Zeyu Guo
2025	J	`jnl`	Improved Decoding of Tanner Codes. CoRR Zhaienhe Zhou, Zeyu Guo
2025	A*	`conf`	Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. ICALP Roni Con, Zeyu Guo, Ray Li, Zihan Zhang
2024	J	`jnl`	Fast Multivariate Multipoint Evaluation over All Finite Fields. J. ACM Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2024	A	`conf`	Hilbert Functions and Low-Degree Randomness Extractors. APPROX/RANDOM Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan
2024	J	`jnl`	Hilbert Functions and Low-Degree Randomness Extractors. CoRR Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan
2024	J	`jnl`	Hilbert Functions and Low-Degree Randomness Extractors. Electron. Colloquium Comput. Complex. Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan
2024	J	`jnl`	Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings. SIAM J. Comput. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2024	J	`jnl`	Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. CoRR Ashish Dwivedi, Zeyu Guo, Ben Lee Volk
2024	J	`jnl`	Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. Electron. Colloquium Comput. Complex. Ashish Dwivedi, Zeyu Guo, Ben Lee Volk
2024	A	`conf`	Optimal Pseudorandom Generators for Low-Degree Polynomials over Moderately Large Fields. APPROX/RANDOM Ashish Dwivedi, Zeyu Guo, Ben Lee Volk
2024	A*	`conf`	Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. FOCS Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
2024	J	`jnl`	Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
2024	J	`jnl`	Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. CoRR Roni Con, Zeyu Guo, Ray Li, Zihan Zhang
2024	J	`jnl`	Variety Evasive Subspace Families. Comput. Complex. Zeyu Guo
2023	A*	`conf`	Extractors for Images of Varieties. STOC Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
2023	A*	`conf`	Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. FOCS Zeyu Guo, Zihan Zhang
2022	J	`jnl`	Derandomization from Algebraic Hardness. SIAM J. Comput. Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2022	J	`jnl`	Efficient List-Decoding With Constant Alphabet and List Sizes. IEEE Trans. Inf. Theory Zeyu Guo, Noga Ron-Zewi
2022	J	`jnl`	Extractors for Images of Varieties. CoRR Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
2022	J	`jnl`	Extractors for Images of Varieties. Electron. Colloquium Comput. Complex. Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
2022	A*	`conf`	Fast Multivariate Multipoint Evaluation Over All Finite Fields. FOCS Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2022	J	`jnl`	Fast Multivariate Multipoint Evaluation Over All Finite Fields. CoRR Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2022	J	`jnl`	Fast Multivariate Multipoint Evaluation Over All Finite Fields. Electron. Colloquium Comput. Complex. Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
2021	A*	`conf`	Efficient list-decoding with constant alphabet and list sizes. STOC Zeyu Guo, Noga Ron-Zewi
2021	A*	`conf`	Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. FOCS Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2021	A	`conf`	Variety Evasive Subspace Families. CCC Zeyu Guo
2021	J	`jnl`	Variety Evasive Subspace Families. CoRR Zeyu Guo
2021	J	`jnl`	Variety Evasive Subspace Families. Electron. Colloquium Comput. Complex. Zeyu Guo
2020	J	`jnl`	Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes. J. Symb. Comput. Zeyu Guo
2020	J	`jnl`	Efficient List-Decoding with Constant Alphabet and List Sizes. CoRR Zeyu Guo, Noga Ron-Zewi
2020	J	`jnl`	Efficient List-Decoding with Constant Alphabet and List Sizes. Electron. Colloquium Comput. Complex. Zeyu Guo, Noga Ron-Zewi
2020	B	`conf`	Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. MFCS Zeyu Guo
2020	J	`jnl`	Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. CoRR Zeyu Guo
2020	—	`conf`	Improved Explicit Hitting-Sets for ROABPs. APPROX-RANDOM Zeyu Guo, Rohit Gurjar
2020	J	`jnl`	Improved List-Decodability of Reed-Solomon Codes via Tree Packings. CoRR Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2020	J	`jnl`	Improved List-Decodability of Reed-Solomon Codes via Tree Packings. Electron. Colloquium Comput. Complex. Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
2019	J	`jnl`	Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field. Theory Comput. Zeyu Guo, Nitin Saxena, Amit Sinhababu
2019	A*	`conf`	Derandomization from Algebraic Hardness: Treading the Borders. FOCS Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon
2018	A	`conf`	Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity. CCC Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018	J	`jnl`	Algebraic dependencies and PSPACE algorithms in approximative complexity. CoRR Zeyu Guo, Nitin Saxena, Amit Sinhababu
2018	J	`jnl`	Algebraic dependencies and PSPACE algorithms in approximative complexity. Electron. Colloquium Comput. Complex. Zeyu Guo, Nitin Saxena, Amit Sinhababu
2017	—	`—`	P-Schemes and Deterministic Polynomial Factoring Over Finite Fields. Zeyu Guo
2017	J	`jnl`	𝒫-schemes and Deterministic Polynomial Factoring over Finite Fields. CoRR Zeyu Guo
2016	B	`conf`	Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. MFCS Zeyu Guo, Anand Kumar Narayanan, Chris Umans
2016	J	`jnl`	Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. CoRR Zeyu Guo, Anand Kumar Narayanan, Chris Umans
2015	A*	`conf`	Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. SODA Zeyu Guo, He Sun
2013	J	`jnl`	Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading. CoRR Zeyu Guo, He Sun
2013	—	`conf`	Randomness-Efficient Curve Samplers. APPROX-RANDOM Zeyu Guo
2013	J	`jnl`	Randomness-efficient Curve Samplers. CoRR Zeyu Guo
2013	J	`jnl`	Randomness-efficient Curve Samplers. Electron. Colloquium Comput. Complex. Zeyu Guo
2011	J	`jnl`	Greedy Construction of 2-Approximate Minimum Manhattan Networks. Int. J. Comput. Geom. Appl. Zeyu Guo, He Sun, Hong Zhu
2011	J	`jnl`	Minimum Manhattan Network is NP-Complete. Discret. Comput. Geom. Francis Y. L. Chin, Zeyu Guo, He Sun
2009	—	`conf`	Minimum Manhattan network is NP-complete. SCG Francis Y. L. Chin, Zeyu Guo, He Sun
2008	C	`conf`	A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. AAIM Zeyu Guo, He Sun, Hong Zhu
2008	B	`conf`	Greedy Construction of 2-Approximation Minimum Manhattan Network. ISAAC Zeyu Guo, He Sun, Hong Zhu