Zeyu Guo
Orcid: 0000-0001-7893-4346
According to our database1,
Zeyu Guo
authored at least 29 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields.
Electron. Colloquium Comput. Complex., 2024
2023
Bayesian Model for 3D Undulating Terrain Depth Estimation Using Photon Counting LiDAR.
Remote. Sens., October, 2023
An ADC-Less RRAM-Based Computing-in-Memory Macro With Binary CNN for Efficient Edge AI.
IEEE Trans. Circuits Syst. II Express Briefs, June, 2023
Global Finite-Time Stabilization of Spacecraft Attitude With Disturbances via Continuous Nonlinear Controller.
IEEE Trans. Aerosp. Electron. Syst., June, 2023
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Electron. Colloquium Comput. Complex., 2022
Mixed-Precision Continual Learning Based on Computational Resistance Random Access Memory.
Adv. Intell. Syst., 2022
Few-shot graph learning with robust and energy-efficient memory-augmented graph neural network (MAGNN) based on homogeneous computing-in-memory.
Proceedings of the IEEE Symposium on VLSI Technology and Circuits (VLSI Technology and Circuits 2022), 2022
3D Reservoir Computing with High Area Efficiency (5.12 TOPS/mm<sup>2</sup>) Implemented by 3D Dynamic Memristor Array for Temporal Signal Processing.
Proceedings of the IEEE Symposium on VLSI Technology and Circuits (VLSI Technology and Circuits 2022), 2022
2021
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract].
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Deterministic polynomial factoring over finite fields: A uniform approach via P-schemes.
J. Symb. Comput., 2020
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
2019
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field.
Theory Comput., 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Electron. Colloquium Comput. Complex., 2018
2017
2016
Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2013
2011
Int. J. Comput. Geom. Appl., 2011
2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the Algorithmic Aspects in Information and Management, 2008