8 citations · 21 across the 23 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 1 cited
Optimal Succinct Rank Data Structure via Approximate Nonnegative Tensor Decomposition
Huacheng Yu
Given an -bit array , the succinct rank data structure problem asks to construct a data structure using space bits for , supporting rank queries of form $\matht…
cs.DS2018
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation
Jelani Nelson, Huacheng Yu
We show optimal lower bounds for spanning forest computation in two different models: * One wants a data structure for fully dynamic spanning forest in which updates can insert or…