A New Variation of Hat Guessing Games. - Tengyu Ma 001; Xiaoming Sun 001; Huacheng Yu (COCOON, 2011)

On a conjecture of Butler and Graham. - Tengyu Ma 001; Xiaoming Sun 001; Huacheng Yu (Des. Codes Cryptogr., 2013)

Finding orthogonal vectors in discrete structures. - Ryan Williams 001; Huacheng Yu (SODA, 2014)

More Applications of the Polynomial Method to Algorithm Design. - Amir Abboud; Richard Ryan Williams; Huacheng Yu (SODA, 2015)

Finding Four-Node Subgraphs in Triangle Time. - Virginia Vassilevska Williams; Joshua R. Wang; Richard Ryan Williams; Huacheng Yu (SODA, 2015)

Cell-probe lower bounds for dynamic problems via a new communication model. - Huacheng Yu (STOC, 2016)

Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication. - Omri Weinstein; Huacheng Yu (Electron. Colloquium Comput. Complex., 2016)

Beating Brute Force for Systems of Polynomial Equations over Finite Fields. - Daniel Lokshtanov; Ramamohan Paturi; Suguru Tamaki; R. Ryan Williams; Huacheng Yu (SODA, 2017)

DecreaseKeys are expensive for external memory priority queues. - Kasper Eenberg; Kasper Green Larsen; Huacheng Yu (STOC, 2017)

Fillable arrays with constant time operations and a single bit of redundancy. - Jacob Teo Por Loong; Jelani Nelson; Huacheng Yu (CoRR, 2017)

Distance Labelings on Random Power Law Graphs. - Huacheng Yu; Hongyang Zhang (CoRR, 2017)

Cell-Probe Lower Bounds from Online Communication Complexity. - Josh Alman; Joshua R. Wang; Huacheng Yu (Electron. Colloquium Comput. Complex., 2017)

Techniques for proving data structure lower bounds. - Huacheng Yu (2017)

Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. - Jelani Nelson; Huacheng Yu (Electron. Colloquium Comput. Complex., 2018)

An improved combinatorial algorithm for Boolean matrix multiplication. - Huacheng Yu (Inf. Comput., 2018)

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. - Amir Abboud; Virginia Vassilevska Williams; Huacheng Yu (SIAM J. Comput., 2018)

Optimal succinct rank data structure via approximate nonnegative tensor decomposition. - Huacheng Yu (STOC, 2019)

Pruning based Distance Sketches with Provable Guarantees on Random Graphs. - Hongyang Zhang 005; Huacheng Yu; Ashish Goel (WWW, 2019)

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 (FOCS, 2020)

Succinct Filters for Sets of Unknown Sizes. - Mingmou Liu; Yitong Yin; Huacheng Yu (ICALP, 2020)

Faster Update Time for Turnstile Streaming Algorithms. - Josh Alman; Huacheng Yu (SODA, 2020)

How to Store a Random Walk. - Emanuele Viola; Omri Weinstein; Huacheng Yu (SODA, 2020)

Lower bound for succinct range minimum query. - Mingmou Liu; Huacheng Yu (STOC, 2020)

Fast Software Cache Design for Network Appliances. - Dong Zhou 006; Huacheng Yu; Michael Kaminsky; David G. Andersen (USENIX ATC, 2020)

Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. - Kasper Green Larsen; Omri Weinstein; Huacheng Yu (SIAM J. Comput., 2020)

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh R. Saxena; Zhao Song 002; Huacheng Yu (ICALP, 2021)

Tight Distributed Sketching Lower Bound for Connectivity. - Huacheng Yu (SODA, 2021)

Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Zhao Song 002; Huacheng Yu (Electron. Colloquium Comput. Complex., 2021)

Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract). - Huacheng Yu (FOCS, 2022)

Optimal Bounds for Approximate Counting. - Jelani Nelson; Huacheng Yu (PODS, 2022)

Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Zhao Song 002; Huacheng Yu (Electron. Colloquium Comput. Complex., 2022)

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. - Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Huacheng Yu (Electron. Colloquium Comput. Complex., 2022)

Strong XOR Lemma for Communication with Bounded Rounds. - Huacheng Yu (Electron. Colloquium Comput. Complex., 2022)

Nearly Optimal Static Las Vegas Succinct Dictionary. - Huacheng Yu (SIAM J. Comput., 2022)

On Constructing Spanners from Random Gaussian Projections. - Sepehr Assadi; Michael Kapralov; Huacheng Yu (APPROX/RANDOM, 2023)

Super-Logarithmic Lower Bounds for Dynamic Graph Problems. - Kasper Green Larsen; Huacheng Yu (FOCS, 2023)

Dynamic "Succincter". - Tianxiao Li; Jingxun Liang; Huacheng Yu; Renfei Zhou (FOCS, 2023)

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. - Tianxiao Li; Jingxun Liang; Huacheng Yu; Renfei Zhou (FOCS, 2023)

Detecting TCP Packet Reordering in the Data Plane. - Yufei Zheng; Huacheng Yu; Jennifer Rexford (CoRR, 2023)

Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions. - Huacheng Yu; Wei Zhan (Electron. Colloquium Comput. Complex., 2023)

Sampling, Flowers and Communication. - Huacheng Yu; Wei Zhan (Electron. Colloquium Comput. Complex., 2023)

On the Amortized Complexity of Approximate Counting. - Ishaq Aden-Ali; Yanjun Han; Jelani Nelson; Huacheng Yu (APPROX/RANDOM, 2024)

A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches. - Elena Gribelyuk; Honghao Lin; David P. Woodruff; Huacheng Yu; Samson Zhou (FOCS, 2024)

Dynamic Dictionary with Subconstant Wasted Bits per Key. - Tianxiao Li; Jingxun Liang; Huacheng Yu; Renfei Zhou (SODA, 2024)

A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches. - Elena Gribelyuk; Honghao Lin; David P. Woodruff; Huacheng Yu; Samson Zhou (CoRR, 2024)

Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald. - Elena Gribelyuk; Pachara Sawettamalya; Hongxun Wu; Huacheng Yu (Proc. ACM Manag. Data, 2024)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors. - Elena Gribelyuk; Pachara Sawettamalya; Hongxun Wu; Huacheng Yu (SODA, 2025)

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness. - Elena Gribelyuk; Honghao Lin; David P. Woodruff; Huacheng Yu; Samson Zhou (STOC, 2025)

Optimal Static Dictionary with Worst-Case Constant Query Time. - Yang Hu; Jingxun Liang; Huacheng Yu; Junkai Zhang; Renfei Zhou (STOC, 2025)

Strong XOR Lemma for Information Complexity. - Pachara Sawettamalya; Huacheng Yu (STOC, 2025)