| Lattice Problems Beyond Polynomial Time D Aggarwal, H Bennett, Z Brakerski, A Golovnev, R Kumar, Z Li, S Peters, ... Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1516-1526, 2023 | 8 | 2023 |
| Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms D Aggarwal, Y Chen, R Kumar, Z Li, N Stephens-Davidowitz Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 7 | 2021 |
| A -Time Algorithm for -SVP and -Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP D Aggarwal, Z Li, N Stephens-Davidowitz Advances in Cryptology–EUROCRYPT 2021: 40th Annual International Conference …, 2021 | 6 | 2021 |
| The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs YJ Chang, Z Li Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023 | 3 | 2023 |
| Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform Z Li Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2000-2007, 2024 | 1 | 2024 |
| Oblivious Classes Revisited: Lower Bounds and Hierarchies K Gajulapalli, Z Li, I Volkovich https://eccc.weizmann.ac.il/report/2024/049/, 2024 | 1 | 2024 |
| Improved Lower Bounds for 3-Query Matching Vector Codes D Aggarwal, P Dutta, Z Li, M Obremski, S Saraogi https://eccc.weizmann.ac.il/report/2024/061/, 2024 | | 2024 |
| On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity E Chung, A Golovnev, Z Li, M Obremski, S Saraogi, ... https://eccc.weizmann.ac.il/report/2023/193/, 2023 | | 2023 |
Noah Stephens-DavidowitzCornell UniversityVerified email at cornell.edu
