Zeyong Li

Orcid: 0009-0004-8121-5149

According to our database1, Zeyong Li authored at least 12 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Oblivious Classes Revisited: Lower Bounds and Hierarchies.
Electron. Colloquium Comput. Complex., 2024

Improved Lower Bounds for 3-Query Matching Vector Codes.
Electron. Colloquium Comput. Complex., 2024

2023
Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform.
Electron. Colloquium Comput. Complex., 2023

On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity.
Electron. Colloquium Comput. Complex., 2023

Lattice Problems beyond Polynomial Time.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
A computation model with automatic functions and relations as primitive operations.
Theor. Comput. Sci., 2022

Alternating Automatic Register Machines.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

2021
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.
CoRR, 2021

Dimension-Preserving Reductions Between SVP and CVP in Different <i>p</i>-Norms.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A 2<sup>n/2</sup>-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
A 2<sup>n/2</sup>-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP.
CoRR, 2020


  Loading...