1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2026
A Matrix Factorization Approach in Turnstile Streaming
Jan Bulanek, Ravi Kumar, Raghu Meka +2
We define the -point query problem in data streams. Given a fixed matrix , the goal is to maintain a vector under turnstile updates and answer each query with an esti…
cs.DS2012
On Online Labeling with Polynomially Many Labels
Martin Babka, Jan Bulánek, Vladimír Čunát +2
In the online labeling problem with parameters n and m we are presented with a sequence of n keys from a totally ordered universe U and must assign each arriving key a label from t…
cs.DS2011★ 1 cited
Tight lower bounds for online labeling problem
Jan Bulánek, Michal Koucký, Michael Saks
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1,...,r} are to be stored in an array of size m >= n. The…