V. Braverman

activity

20072026

most citedRecursive Sketching For Frequency Moments

28 citations · 325 across the 73 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

cs.DS2014

Universal Streaming

Vladimir Braverman, Rafail Ostrovsky, Alan Roytman

Given a stream of data, a typical approach in streaming algorithms is to design a sophisticated algorithm with small memory that computes a specific statistic over the streaming da…

cs.DS2014★ 1 cited

Universal sketches for the frequency negative moments and other decreasing streaming sums

Vladimir Braverman, Stephen R. Chestnut

Given a stream with frequencies $f_{d}$ , for $d \in [n]$ , we characterize the space necessary for approximating the frequency negative moments $F_{p} = \sum ∣ f_{d} ∣^{p}$ , where $p < 0$ and the s…

cs.DS2014★ 4 cited

Approximating Large Frequency Moments with $O (n^{1 - 2/ k})$ Bits

Vladimir Braverman, Jonathan Katzman, Charles Seidell +1

In this paper we consider the problem of approximating frequency moments in the streaming model. Given a stream $D = {p_{1}, p_{2}, \dots, p_{m}}$ of numbers from ${1, \dots, n}$ , a freq…

Universal Streaming

Universal sketches for the frequency negative moments and other decreasing streaming sums

Approximating Large Frequency Moments with O(n1−2/k) Bits

Approximating Large Frequency Moments with $O (n^{1 - 2/ k})$ Bits