| Complexity-theoretic foundations of quantum supremacy experiments S Aaronson, L Chen 32nd Computational Complexity Conference (CCC 2017), 2017 | 518 | 2017 |
| Nearly instance optimal sample complexity bounds for top-k arm selection L Chen, J Li, M Qiao 20th International Conference on Artificial Intelligence and Statistics …, 2017 | 92 | 2017 |
| Towards instance optimal bounds for best arm identification L Chen, J Li, M Qiao Conference on Learning Theory, 535-592, 2017 | 85 | 2017 |
| On the optimal sample complexity for best arm identification L Chen, J Li arXiv preprint arXiv:1511.03774, 2015 | 78 | 2015 |
| On the hardness of approximate and exact (bichromatic) maximum inner product L Chen 33rd Computational Complexity Conference (CCC 2018), 2018 | 74 | 2018 |
| Pure exploration of multi-armed bandit under matroid constraints L Chen, A Gupta, J Li Conference on Learning Theory, 647-669, 2016 | 72 | 2016 |
| Nearly optimal sampling algorithms for combinatorial pure exploration L Chen, A Gupta, J Li, M Qiao, R Wang Conference on Learning Theory, 482-534, 2017 | 65 | 2017 |
| An equivalence class for orthogonal vectors L Chen, R Williams Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 57 | 2019 |
| On the power of statistical zero knowledge A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019 | 54 | 2019 |
| Beyond natural proofs: Hardness magnification and locality L Chen, S Hirahara, IC Oliveira, J Pich, N Rajgopal, R Santhanam ACM Journal of the ACM (JACM) 69 (4), 1-49, 2022 | 53 | 2022 |
| Efficient construction of rigid matrices using an NP oracle J Alman, L Chen SIAM Journal on Computing 54 (4), FOCS19-102-FOCS19-134, 2025 | 49 | 2025 |
| Hardness magnification for all sparse NP languages L Chen, C Jin, RR Williams 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 46 | 2019 |
| Bootstrapping results for threshold circuits “just beyond” known lower bounds L Chen, R Tell Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 46 | 2019 |
| Almost-everywhere circuit lower bounds from non-trivial derandomization L Chen, X Lyu, RR Williams 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 1-12, 2020 | 43 | 2020 |
| Hardness vs. randomness, revised: uniform, non-black-box, and instance-wise L Chen, R Tell SIAM Journal on Computing, FOCS21-323-FOCS21-392, 2024 | 41 | 2024 |
| Fine-grained complexity meets IP= PSPACE L Chen, S Goldwasser, K Lyu, GN Rothblum, A Rubinstein Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 40 | 2019 |
| On distributed differential privacy and counting distinct elements L Chen, B Ghazi, R Kumar, P Manurangsi arXiv preprint arXiv:2009.09604, 2020 | 36 | 2020 |
| Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity L Chen, RR Williams 34th Computational Complexity Conference (CCC 2019), 19: 1-19: 43, 2019 | 36 | 2019 |
| Nondeterministic Quasi-Polynomial Time is Average-Case Hard for Circuits L Chen SIAM Journal on Computing 54 (4), FOCS19-332-FOCS19-397, 2025 | 35* | 2025 |
| Strong average-case lower bounds from non-trivial derandomization L Chen, H Ren Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 34 | 2020 |
Richard Ryan WilliamsMITVerified email at mit.edu
