| 2026 | SODA | Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck. | William Kuszmaul, Jingxun Liang, Renfei Zhou |
| 2025 | FOCS | Static Retrieval Revisited: To Optimality and Beyond. | Yang Hu, William Kuszmaul, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou |
| 2025 | FOCS | Fingerprint Filters Are Optimal. | William Kuszmaul, Jingxun Liang, Renfei Zhou |
| 2025 | ICALP | Optimal Static Fully Indexable Dictionaries. | Jingxun Liang, Renfei Zhou |
| 2025 | STOC | Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin. | Lijie Chen, Jiatu Li, Jingxun Liang |
| 2025 | STOC | Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification. | Josh Alman, Jingxun Liang |
| 2025 | STOC | Optimal Static Dictionary with Worst-Case Constant Query Time. | Yang Hu, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou |
| 2024 | SODA | Dynamic Dictionary with Subconstant Wasted Bits per Key. | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
| 2023 | ESA | On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. | Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou |
| 2023 | FOCS | Dynamic "Succincter". | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
| 2023 | FOCS | Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |