Zeyu Guo
Computer Science · The Ohio State University
Publications
55
Citations
196
Est. group size
—
Recurring co-author estimate
Active years
18
Publishing since 2008
Zeyu Guo works in theoretical computer science, focusing on coding theory, computational complexity, and algebraic algorithms. Much of the research addresses how to construct and efficiently decode error-correcting codes (methods for reliably transmitting or storing data despite errors), as well as related mathematical tools like polynomial evaluation and derandomization (removing randomness from algorithms while preserving performance). This work is largely theoretical and mathematical in nature, aimed at proving fundamental limits and capabilities of coding and algorithmic techniques.
Publication output has grown from a few papers per year in 2017 to a peak in 2024, with consistent activity in recent years averaging under 4 papers annually over the last five years.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Improved Decoding of Tanner Codes
2025
- Random Reed-Solomon codes achieve list-decoding capacity with linear-sized alphabets
Advances in Combinatorics · 2025
- Improved Decoding of Tanner Codes
arXiv (Cornell University) · 2025
- Optimization of Multi-Factory Remanufacturing Processes with Shared Transportation Resources Using the ALNS Algorithm
International Journal of Artificial Intelligence and Green Manufacturing · 2025
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
SIAM Journal on Computing · 2024
- Fast Multivariate Multipoint Evaluation over All Finite Fields
Journal of the ACM · 2024
- Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
2024
- Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
arXiv (Cornell University) · 2024
- Variety Evasive Subspace Families
Computational Complexity · 2024
- Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
arXiv (Cornell University) · 2024
- Improved Proximal Policy Optimization Algorithm for Multi-objective Disassembly Line Balancing Considering Hazardous Tasks
2024
- Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
2023
- Extractors for Images of Varieties
2023
- Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
arXiv (Cornell University) · 2023
- Derandomization from Algebraic Hardness
SIAM Journal on Computing · 2022
- arXiv (Cornell University)×14
- Leibniz-Zentrum für Informatik (Schloss Dagstuhl)×3
- SIAM Journal on Computing×2
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×2
- IOP Conference Series Earth and Environmental Science×2
- Carlos Agrinsoni
Computer Science · Purdue University West Lafayette
- Pooya Hatami
Computer Science · The Ohio State University
- Hanho Lee
Computer Science · The Ohio State University
- Jiaxuan Cai
Computer Science · The Ohio State University
- Xinmiao Zhang
Computer Science · The Ohio State University
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 19, 2026.
Claim or correct this profile