| 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 |
| On the robustness of countsketch to adaptive inputs E Cohen, X Lyu, J Nelson, T Sarlós, M Shechner, U Stemmer International conference on machine learning, 4112-4140, 2022 | 35 | 2022 |
| Composition theorems for interactive differential privacy X Lyu Advances in Neural Information Processing Systems 35, 9700-9712, 2022 | 31 | 2022 |
| Optimal differentially private learning of thresholds and quasi-concave optimization E Cohen, X Lyu, J Nelson, T Sarlós, U Stemmer Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 472-482, 2023 | 27 | 2023 |
| Range avoidance for low-depth circuits and connections to pseudorandomness V Guruswami, X Lyu, X Wang Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022 | 23 | 2022 |
| Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma L Chen, X Lyu Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 18 | 2021 |
| Weighted pseudorandom generators via inverse analysis of random walks and shortcutting L Chen, WM Hoza, X Lyu, A Tal, H Wu 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 12 | 2023 |
| Lower bounds for differential privacy under continual observation and online threshold queries E Cohen, X Lyu, J Nelson, T Sarlós, U Stemmer The Thirty Seventh Annual Conference on Learning Theory, 1200-1222, 2024 | 11 | 2024 |
| Generalized private selection and testing with high confidence E Cohen, X Lyu, J Nelson, T Sarlós, U Stemmer arXiv preprint arXiv:2211.12063, 2022 | 9 | 2022 |
| Majority vs. approximate linear sum and average-case complexity below NC1 L Chen, Z Lu, X Lyu, IC Oliveira 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 9 | 2021 |
| New PRGs for unbounded-width/adaptive-order read-once branching programs L Chen, X Lyu, A Tal, H Wu Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2023 | 8 | 2023 |
| Improved pseudorandom generators for AC⁰ circuits X Lyu 37th Computational Complexity Conference (CCC 2022), 34: 1-34: 25, 2022 | 8 | 2022 |
| The target-charging technique for privacy analysis across interactive computations E Cohen, X Lyu Advances in Neural Information Processing Systems 36, 62139-62168, 2023 | 7* | 2023 |
| Tight time-space lower bounds for constant-pass learning X Lyu, A Tal, H Wu, J Yang 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 6 | 2023 |
| Time-space tradeoffs for element distinctness and set intersection via pseudorandomness X Lyu, W Zhu Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 6 | 2023 |
| Hot pate: Private aggregation of distributions for diverse task E Cohen, B Cohen-Wang, X Lyu, J Nelson, T Sarlos, U Stemmer arXiv preprint arXiv:2312.02132, 2023 | 4 | 2023 |
| The cost of parallelizing boosting X Lyu, H Wu, J Yang Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 2 | 2024 |
| Private Learning of Littlestone Classes, Revisited X Lyu arXiv preprint arXiv:2510.00076, 2025 | 1 | 2025 |
| Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis X Lyu, K Talwar Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2374-2385, 2025 | 1 | 2025 |
| Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case V Guruswami, X Lyu, W Yuan Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2026 | | 2026 |
