| 2026 | ESA | On the Communication Complexity of Maximum Matching and Negative-Weight Shortest Paths. | Yu Cheng, Tianle Jiang, Pachara Sawettamalya, Huacheng Yu |
| 2026 | STOC | Adversarial Robustness on Insertion-Deletion Streams. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2025 | FOCS | Static Retrieval Revisited: To Optimality and Beyond. | Yang Hu, William Kuszmaul, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou |
| 2025 | SODA | Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors. | Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu |
| 2025 | STOC | Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2025 | STOC | Optimal Static Dictionary with Worst-Case Constant Query Time. | Yang Hu, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou |
| 2025 | STOC | Strong XOR Lemma for Information Complexity. | Pachara Sawettamalya, Huacheng Yu |
| 2024 | FOCS | A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2024 | SODA | Dynamic Dictionary with Subconstant Wasted Bits per Key. | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
| 2023 | FOCS | Super-Logarithmic Lower Bounds for Dynamic Graph Problems. | Kasper Green Larsen, Huacheng Yu |
| 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 |
| 2023 | SODA | Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2022 | FOCS | Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract). | Huacheng Yu |
| 2022 | PODS | Optimal Bounds for Approximate Counting. | Jelani Nelson, Huacheng Yu |
| 2021 | ICALP | Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2021 | SODA | Tight Distributed Sketching Lower Bound for Connectivity. | Huacheng Yu |
| 2021 | STOC | Almost optimal super-constant-pass streaming lower bounds for reachability. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2020 | FOCS | Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. | Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu |
| 2020 | ICALP | Succinct Filters for Sets of Unknown Sizes. | Mingmou Liu, Yitong Yin, Huacheng Yu |
| 2020 | SODA | Faster Update Time for Turnstile Streaming Algorithms. | Josh Alman, Huacheng Yu |
| 2020 | SODA | How to Store a Random Walk. | Emanuele Viola, Omri Weinstein, Huacheng Yu |
| 2020 | STOC | Lower bound for succinct range minimum query. | Mingmou Liu, Huacheng Yu |
| 2020 | STOC | Nearly optimal static Las Vegas succinct dictionary. | Huacheng Yu |
| 2020 | USENIX | Fast Software Cache Design for Network Appliances. | Dong Zhou, Huacheng Yu, Michael Kaminsky, David G. Andersen |
| 2019 | WWW | Pruning based Distance Sketches with Provable Guarantees on Random Graphs. | Hongyang Zhang, Huacheng Yu, Ashish Goel |
| 2019 | SODA | Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. | Jelani Nelson, Huacheng Yu |
| 2019 | STOC | Optimal succinct rank data structure via approximate nonnegative tensor decomposition. | Huacheng Yu |
| 2018 | ITA | Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. | Kasper Green Larsen, Omri Weinstein, Huacheng Yu |
| 2018 | STOC | Cell-probe lower bounds from online communication complexity. | Josh Alman, Joshua R. Wang, Huacheng Yu |
| 2018 | STOC | Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. | Kasper Green Larsen, Omri Weinstein, Huacheng Yu |
| 2017 | SODA | Beating Brute Force for Systems of Polynomial Equations over Finite Fields. | Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu |
| 2017 | STOC | DecreaseKeys are expensive for external memory priority queues. | Kasper Eenberg, Kasper Green Larsen, Huacheng Yu |
| 2016 | FOCS | Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication. | Omri Weinstein, Huacheng Yu |
| 2016 | STOC | Cell-probe lower bounds for dynamic problems via a new communication model. | Huacheng Yu |
| 2015 | ICALP | An Improved Combinatorial Algorithm for Boolean Matrix Multiplication. | Huacheng Yu |
| 2015 | SODA | More Applications of the Polynomial Method to Algorithm Design. | Amir Abboud, Richard Ryan Williams, Huacheng Yu |
| 2015 | SODA | Finding Four-Node Subgraphs in Triangle Time. | Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu |
| 2015 | STOC | Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. | Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu |
| 2014 | SODA | Finding orthogonal vectors in discrete structures. | Ryan Williams, Huacheng Yu |
| 2011 | COCOON | A New Variation of Hat Guessing Games. | Tengyu Ma, Xiaoming Sun, Huacheng Yu |