Zeyu Guo

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Variety evasive subspace families	2024-09-06	Paper
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings	2024-04-04	Paper
Improved Explicit Hitting-Sets for ROABPs	2023-10-31	Paper
Variety evasive subspace families	2023-07-12	Paper
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets	2023-04-03	Paper
Extractors for Images of Varieties	2022-11-26	Paper
https://portal.mardi4nfdi.de/entity/Q5089209	2022-07-18	Paper
Derandomization from Algebraic Hardness	2022-05-03	Paper
Improved List-Decodability of Reed--Solomon Codes via Tree Packings	2020-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q5121898	2020-09-22	Paper
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach	2020-07-01	Paper
Algebraic dependencies and $\mathsf{PSPACE}$ algorithms in approximative complexity over any field	2020-02-12	Paper
Deterministic polynomial factoring over finite fields: a uniform approach via $\mathcal{P}$-schemes	2019-06-28	Paper
Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields	2018-03-21	Paper
Minimum Manhattan network is NP-complete	2017-10-20	Paper
Gossip vs. Markov chains, and randomness-efficient rumor spreading	2017-10-05	Paper
$\mathcal{P}$-schemes and Deterministic Polynomial Factoring over Finite Fields	2017-06-30	Paper
Randomness-efficient curve samplers	2013-10-04	Paper
Greedy construction of 2-approximate minimum Manhattan networks	2011-08-23	Paper
Minimum Manhattan network is NP-complete	2011-06-03	Paper
Greedy Construction of 2-Approximation Minimum Manhattan Network	2009-01-29	Paper
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem	2008-07-10	Paper
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric	N/A	Paper

Research outcomes over time

This page was built for person: Zeyu Guo