Skip to main content

Braverman, Vladimir

Assistant Professor
Department Of Computer Science

Malone 211
3400 N Charles St
(410) 516-4975

Jump to:


Vladimir Braverman

CS’ Vladimir Braverman to receive NSF CAREER Award

January 31, 2017

Vladimir Braverman, an assistant professor in the Department of Computer Science, has been chosen by the National Science Foundation for its prestigious CAREER Award, which recognizes early stage scholars with high levels of promise and excellence.

Read More


  • Ph.D. May 03, 2011, University of California
  • M.S. 2004, Ben-Gurion University of Negev
  • B.S. 1998, Ben-Gurion University
Research Areas
  • Algorithms, Theoretical Computer Science, Big Data
  • 2014:  Google Research Award
  • "An Optimal Algorithm For Large Frequency Moments Using O(n^1-2/k) Bits", NII Shonan Meeting on "Algorithms for Large-Scale Graphs" .  Shonan, Japan.  October 17, 2014
  • "An Optimal Algorithm For Large Frequency Moments Using O(n^1-2/k) Bits", Maryland Theory Day 2014.  University of Maryland.  October 10, 2014
  • "Approximating Large Frequency Moments with $O(n^{1−2/k})$ Bits", Bertinoro Workshop on Sublinear Algorithms.  Bertinoro, Italy.  May 28, 2014
  • "Approximating Large Frequency Moments with O(n^{1-2/k}) Bits", Theory of Computation at Harvard.  Harvard University.  January 28, 2014


Journal Articles
  • Braverman, V., Katzman, J., Seidell, C., Vorsanger, G. (2014).  Approximating Large Frequency Moments with O(n1-2/k) Bits.  CoRR.  abs/1401.1763.
  • Braverman, V., Gelles, R., Ostrovsky, R. (2014).  How to catch L_2-heavy-hitters on sliding windows.  Theor. Comput. Sci..  554.  82–94.
  • Braverman, V., Chestnut, S. R. (2014).  Streaming sums in sublinear space.  CoRR.  abs/1408.5096.
  • Braverman, V., Ostrovsky, R., Roytman, A. (2014).  Universal Streaming.  CoRR.  abs/1408.2604.
  • Braverman, V., Ostrovsky, R., Vilenchik, D. (2013).  How Hard is Counting Triangles in the Streaming Model.  CoRR.  abs/1304.1458.
  • Braverman, V., Ostrovsky, R. (2012).  Approximating Large Frequency Moments with Pick-and-Drop Sampling.  CoRR.  abs/1212.0202.
  • Braverman, V., Ostrovsky, R., Zaniolo, C. (2012).  Optimal sampling from sliding windows.  Journal of Computer and System Sciences.  78(1).  260-272.
  • Braverman, V., Meyerson, A., Ostrovsky, R., Roytman, A., Shindler, M., Tagiku, B., SIAM., ACM. (2011).  Streaming k-means on Well-Clusterable Data.  Proceedings of the Twenty-Second Annual Acm-Siam Symposium on Discrete Algorithms.  26-40.
  • Braverman, V., Ostrovsky, R. (2010).  EFFECTIVE COMPUTATIONS ON SLIDING WINDOWS.  Siam Journal on Computing.  39(6).  2113-2131.
  • Braverman, V., Gelles, R., Ostrovsky, R. (2010).  How to Catch L_2-Heavy-Hitters on Sliding Windows.  CoRR.  abs/1012.3130.
  • Braverman, V., Ostrovsky, R., ACM. (2010).  Measuring Independence of Datasets.  Stoc 2010: Proceedings of the 2010 Acm Symposium on Theory of Computing.  271-280.
  • Braverman, V., Ostrovsky, R., Rabani, Y. (2010).  Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform.  CoRR.  abs/1011.2590.
  • Braverman, V., Ostrovsky, R. (2010).  Recursive Sketching For Frequency Moments.  CoRR.  abs/1011.2571.
  • Braverman, V., Ostrovsky, R., ACM. (2010).  Zero-One Frequency Laws.  Stoc 2010: Proceedings of the 2010 Acm Symposium on Theory of Computing.  281-290.
  • Berend, D., Braverman, V. (2009).  A Linear Algorithm for Computing Convex Hulls for Random Lines.  Acm Transactions on Algorithms.  5(4).
  • Braverman, V., Ostrovsky, R., Zaniolo, C., ACM. (2009).  Optimal Sampling from Sliding Windows.  Pods’09: Proceedings of the Twenty-Eighth Acm Sigmod-Sigact-Sigart Symposium on Principles of Database Systems.  147-156.
  • Braverman, V., Ostrovsky, R. (2008).  Measuring $k$-Wise Independence of Streaming Data.  CoRR.  abs/0806.4790.
  • Braverman, V., Ostrovsky, R. (2007).  Smooth histograms for sliding windows.  48th Annual Ieee Symposium on Foundations of Computer Science, Proceedings.  283-293.
  • Braverman, V., Ostrovsky, R., Zaniolo, C. (2007).  Succinct Sampling on Streams.  CoRR.  abs/cs/0702151.
  • Bachmat, E., Braverman, V. (2006).  Batched disk scheduling with delays.  SIGMETRICS Performance Evaluation Review.  33(4).  36–41.
Other Publications
  • V, B., V, B., S, G., Y, M., M, S., G, S.  Automatic data store arranging and queries treating system for digital data store system, has data arrangements module including query handler, base data loader component, and execution statistics provider component.  HYPERROLL ISRAEL LTD.
  • V, B., M, S., G, S.  Complementary system for data store system, has data store statistics composer component that collects and compiles statistics from data store.  HYPERROLL INC.
  • G, S., V, B., V, B., G, R., M, S.  Method for representing and processing data sets with time series, involves managing storage of data in data store by application layer having application and data store layer.  SADETSKY M.
Conference Proceedings
  • Braverman, V., Katzman, J., Seidell, C., Vorsanger, G. (2014).  An Optimal Algorithm for Large Frequency Moments Using O(n(1-2/k)) Bits.  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain.  531–544.
  • Braverman, V., Vorsanger, G. (2014).  Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy Hitters.  Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings.  13–24.
  • Braverman, V., Ostrovsky, R. (2013).  Approximating Large Frequency Moments with Pick-and-Drop Sampling.  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings.  42–57.
  • Braverman, V., Ostrovsky, R. (2013).  Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams.  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings.  58–70.
  • Braverman, V., Ostrovsky, R., Vilenchik, D. (2013).  How Hard Is Counting Triangles in the Streaming Model?.  Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I.  244–254.
  • Braverman, V., Gelles, R., Ostrovsky, R. (2013).  How to Catch L _2-Heavy-Hitters on Sliding Windows.  Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings.  638–650.
  • Braverman, V., Chung, K., Liu, Z., Mitzenmacher, M., Ostrovsky, R. (2010).  AMS Without 4-Wise Independence on Product Domains.  27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France.  119–130.
  • (2007).  48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings.  IEEE Computer Society.
  • Braverman, V.  "System and method for pick-and-drop sampling ", 2014.
Back to top