8 citations · 21 across the 23 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019★ 1 cited
Faster Update Time for Turnstile Streaming Algorithms
Josh Alman, Huacheng Yu
In this paper, we present a new algorithm for maintaining linear sketches in turnstile streams with faster update time. As an application, we show that \texttt{Count} sket…
cs.DS2019
Nearly Optimal Static Las Vegas Succinct Dictionary
Huacheng Yu
Given a set of (distinct) keys from key space , each associated with a value from , the \emph{static dictionary} problem asks to preprocess these (key, value) pairs…
cs.DS2019
How to Store a Random Walk
Emanuele Viola, Omri Weinstein, Huacheng Yu
Motivated by storage applications, we study the following data structure problem: An encoder wishes to store a collection of jointly-distributed files $\overline{X}:=(X_1,X_2,\ldot…