| 2025 | ESA | Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism. | Laxman Dhulipala, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, Leqi Zhu |
| 2025 | OPODIS | How Exhaustive Does an Extension-Based Proof Need to Be? | Faith Ellen, Shihao Liu, Leqi Zhu, Eli Gafni, Rati Gelashvili |
| 2023 | SODA | Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. | Shang-En Huang, Seth Pettie, Leqi Zhu |
| 2022 | STOC | Byzantine agreement in polynomial time with near-optimal resilience. | Shang-En Huang, Seth Pettie, Leqi Zhu |
| 2020 | PODC | Brief Announcement: Why Extension-Based Proofs Fail. | Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu |
| 2019 | STOC | Why extension-based proofs fail. | Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu |
| 2019 | STACS | Space Lower Bounds for the Signal Detection Problem. | Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu |
| 2018 | PODC | Revisionist Simulations: A New Approach to Proving Space Lower Bounds. | Faith Ellen, Rati Gelashvili, Leqi Zhu |
| 2016 | PODC | A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]. | Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu |
| 2016 | PODC | Brief Announcement: A Tight Space Bound for Consensus. | Leqi Zhu |
| 2016 | STOC | A tight space bound for consensus. | Leqi Zhu |
| 2015 | OPODIS | Atomic Snapshots from Small Registers. | Leqi Zhu, Faith Ellen |