8 citations · 21 across the 23 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 1 cited
Cell-probe Lower Bounds for Dynamic Problems via a New Communication Model
Huacheng Yu
In this paper, we develop a new communication model to prove a data structure lower bound for the dynamic interval union problem. The problem is to maintain a multiset of intervals…
cs.DS2015
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
Huacheng Yu
We present a new combinatorial algorithm for triangle finding and Boolean matrix multiplication that runs in time, where the notation suppresses p…