default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZeyong Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Karthik Gajulapalli, Zeyong Li, Ilya Volkovich:
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies. FSTTCS 2024: 23:1-23:19- [c6]Zeyong Li
:
Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform. STOC 2024: 2000-2007 - [i11]Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi:
Improved Lower Bounds for 3-Query Matching Vector Codes. Electron. Colloquium Comput. Complex. TR24 (2024) - [i10]Karthik Gajulapalli, Zeyong Li, Ilya Volkovich:
Oblivious Classes Revisited: Lower Bounds and Hierarchies. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c5]Yi-Jun Chang, Zeyong Li:
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. PODC 2023: 32-43 - [c4]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems beyond Polynomial Time. STOC 2023: 1516-1526 - [i9]Yi-Jun Chang, Zeyong Li:
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. CoRR abs/2305.01324 (2023) - [i8]Zeyong Li:
Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform. CoRR abs/2310.17762 (2023) - [i7]Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz:
On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity. Electron. Colloquium Comput. Complex. TR23 (2023) - [i6]Zeyong Li:
Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j1]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
A computation model with automatic functions and relations as primitive operations. Theor. Comput. Sci. 924: 94-116 (2022) - [c3]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
Alternating Automatic Register Machines. ICTAC 2022: 195-211 - [i5]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
A Computation Model with Automatic Functions and Relations as Primitive Operations. CoRR abs/2201.06836 (2022) - [i4]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems Beyond Polynomial Time. CoRR abs/2211.11693 (2022) - 2021
- [c2]Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz:
A 2n/2-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. EUROCRYPT (1) 2021: 467-497 - [c1]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz:
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. SODA 2021: 2444-2462 - [i3]Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Zeyong Li, Noah Stephens-Davidowitz:
Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. CoRR abs/2104.06576 (2021) - [i2]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
Alternating Automatic Register Machines. CoRR abs/2111.04254 (2021) - 2020
- [i1]Divesh Aggarwal, Zeyong Li, Noah Stephens-Davidowitz:
A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. CoRR abs/2007.09556 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
