10 citations · 23 across the 8 of their papers we have counts for
3 papers · 1 filter
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order
Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer +3
A central problem in data streams is to characterize which functions of an underlying frequency vector can be approximated efficiently. Recently there has been considerable effort…
BPTree: an heavy hitters algorithm using constant memory
Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin +3
The task of finding heavy hitters is one of the best known and well studied problems in the area of data streams. One is given a list and the goal is to…
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors
Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff +1
A central problem in the theory of algorithms for data streams is to determine which functions on a stream can be approximated in sublinear, and especially sub-polynomial or poly-l…