A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. - Divesh Aggarwal; Zeyong Li; Noah Stephens-Davidowitz (CoRR, 2020)

A 2n/2-Time Algorithm for $ sqrt{n}$-SVP and $ sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. - Divesh Aggarwal; Zeyong Li; Noah Stephens-Davidowitz (EUROCRYPT (1), 2021)

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Zeyong Li; Noah Stephens-Davidowitz (SODA, 2021)

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Zeyong Li; Noah Stephens-Davidowitz (CoRR, 2021)

Alternating Automatic Register Machines. - Ziyuan Gao; Sanjay Jain 001; Zeyong Li; Ammar Fathin Sabili; Frank Stephan 001 (ICTAC, 2022)

A computation model with automatic functions and relations as primitive operations. - Ziyuan Gao; Sanjay Jain 001; Zeyong Li; Ammar Fathin Sabili; Frank Stephan 001 (Theor. Comput. Sci., 2022)

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. - Yi-Jun Chang; Zeyong Li (PODC, 2023)

Lattice Problems beyond Polynomial Time. - Divesh Aggarwal; Huck Bennett; Zvika Brakerski; Alexander Golovnev; Rajendra Kumar 002; Zeyong Li; Spencer Peters; Noah Stephens-Davidowitz; Vinod Vaikuntanathan (STOC, 2023)

On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity. - Eldon Chung; Alexander Golovnev; Zeyong Li; Maciej Obremski; Sidhant Saraogi; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2023)

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

Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies. - Karthik Gajulapalli; Zeyong Li; Ilya Volkovich (FSTTCS, 2024)

Improved Lower Bounds for 3-Query Matching Vector Codes. - Divesh Aggarwal; Pranjal Dutta; Zeyong Li; Maciej Obremski; Sidhant Saraogi (Electron. Colloquium Comput. Complex., 2024)

Oblivious Classes Revisited: Lower Bounds and Hierarchies. - Karthik Gajulapalli; Zeyong Li; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2024)

Downward self-reducibility in the total function polynomial hierarchy. - Karthik Gajulapalli; Surendra Ghentiyala; Zeyong Li; Sidhant Saraogi (Electron. Colloquium Comput. Complex., 2025)

Hierarchies within TFNP: building blocks and collapses. - Surendra Ghentiyala; Zeyong Li (Electron. Colloquium Comput. Complex., 2025)