papers
Publications (12)
math.CO2011
On a Conjecture of Butler and Graham
Tengyu Ma, Xiaoming Sun, Huacheng Yu
cs.DS2015
Cell-probe Lower Bounds for Dynamic Problems via a New Communication Model
Huacheng Yu
cs.DS2019
Optimal Succinct Rank Data Structure via Approximate Nonnegative Tensor Decomposition
Huacheng Yu
cs.DS2016
DecreaseKeys are Expensive for External Memory Priority Queues
Kasper Eenberg, Kasper Green Larsen, Huacheng Yu
cs.DS2016
Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication
Omri Weinstein, Huacheng Yu
math.CO2011
A New Variation of Hat Guessing Games
Tengyu Ma, Xiaoming Sun, Huacheng Yu
cs.DS2017
Cell-Probe Lower Bounds from Online Communication Complexity
Josh Alman, Joshua R. Wang, Huacheng Yu
cs.DS2017
Fillable arrays with constant time operations and a single bit of redundancy
Jacob Teo Por Loong, Jelani Nelson, Huacheng Yu
cs.DS2017
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
Kasper Green Larsen, Omri Weinstein, Huacheng Yu
cs.SI2019
Pruning based Distance Sketches with Provable Guarantees on Random Graphs
Hongyang Zhang, Huacheng Yu, Ashish Goel
cs.DS2019
How to Store a Random Walk
Emanuele Viola, Omri Weinstein, Huacheng Yu
cs.DS2015
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Huacheng Yu