Vladimir Braverman
Vladimir Braverman
Associate Professor of Computer Science, Johns Hopkins University
Verifierad e-postadress på cs.jhu.edu - Startsida
Titel
Citeras av
Citeras av
År
One sketch to rule them all: Rethinking network flow monitoring with univmon
Z Liu, A Manousis, G Vorsanger, V Sekar, V Braverman
Proceedings of the 2016 ACM SIGCOMM Conference, 101-114, 2016
2622016
Methods for effective processing of time series
G Shaked, V Braverman, V Belyaev, G Rubin, M Sadetsky
US Patent 9,047,349, 2015
1762015
Optimal sampling from sliding windows
V Braverman, R Ostrovsky, C Zaniolo
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009
1222009
Streaming k-means on Well-Clusterable Data
V Braverman, A Meyerson, R Ostrovsky, A Roytman, M Shindler, B Tagiku
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
842011
New frameworks for offline and streaming coreset constructions
V Braverman, D Feldman, H Lang
arXiv preprint arXiv:1612.00889, 2016
772016
Smooth histograms for sliding windows
V Braverman, R Ostrovsky
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 283-293, 2007
702007
Primal dual gives almost optimal energy-efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
642017
Zero-one frequency laws
V Braverman, R Ostrovsky
Proceedings of the forty-second ACM symposium on Theory of computing, 281-290, 2010
632010
BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory
V Braverman, SR Chestnut, N Ivkin, J Nelson, Z Wang, DP Woodruff
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017
462017
Communication-efficient distributed SGD with sketching
N Ivkin, D Rothchild, E Ullah, V Braverman, I Stoica, R Arora
arXiv preprint arXiv:1903.04488, 2019
422019
How hard is counting triangles in the streaming model?
V Braverman, R Ostrovsky, D Vilenchik
International Colloquium on Automata, Languages, and Programming, 244-254, 2013
412013
Nitrosketch: Robust and general sketch-based monitoring in software switches
Z Liu, R Ben-Basat, G Einziger, Y Kassner, V Braverman, R Friedman, ...
Proceedings of the ACM Special Interest Group on Data Communication, 334-350, 2019
382019
Distcache: Provable load balancing for large-scale storage systems with distributed caching
Z Liu, Z Bai, Z Liu, X Li, C Kim, V Braverman, X Jin, I Stoica
17th {USENIX} Conference on File and Storage Technologies ({FAST} 19), 143-157, 2019
362019
Beating countsketch for heavy hitters in insertion streams
V Braverman, SR Chestnut, N Ivkin, DP Woodruff
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
362016
Clustering problems on sliding windows
V Braverman, H Lang, K Levin, M Monemizadeh
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
302016
Recursive sketching for frequency moments
V Braverman, R Ostrovsky
arXiv preprint arXiv:1011.2571, 2010
302010
Generalizing the layering method of indyk and woodruff: Recursive sketches for frequency-based vectors on streams
V Braverman, R Ostrovsky
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
282013
{ASAP}: Fast, approximate graph pattern mining at scale
AP Iyer, Z Liu, X Jin, S Venkataraman, V Braverman, I Stoica
13th {USENIX} Symposium on Operating Systems Design and Implementation …, 2018
272018
An Optimal Algorithm for Large Frequency Moments Using O (n^(1-2/k)) Bits
V Braverman, J Katzman, C Seidell, G Vorsanger
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
272014
How to catch l2-heavy-hitters on sliding windows
V Braverman, R Gelles, R Ostrovsky
Theoretical Computer Science 554, 82-94, 2014
262014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20