Vladimir Braverman
I am an Assistant Professor in
the Department of Computer Science in the Whiting School of Engineering at the Johns Hopkins University;
Research Interests:
My research interests include
algorithms for massive data, randomized and streaming algorithms and related
areas.
Publications:
- Vladimir Braverman, Adam Meyerson, Rafail
Ostrovsky, Alan Roytman, Michael Shindler, Brian Tagiku, "Streaming k-means on Well-Clusterable Data," SODA 2011.
- Vladimir Braverman, Rafail Ostrovsky, "Measuring Independence of Datasets," STOC 2010.
- Vladimir
Braverman, Rafail Ostrovsky, "Zero-One
Frequency Laws," STOC 2010.
- Vladimir
Braverman, Kai-Min Chung, Zhenming
Liu, Michael Mitzenmacher, Rafail
Ostrovsky, "AMS
Without 4-Wise Independence on Product Domains,"
STACS 2010.
- Vladimir
Braverman, Rafail Ostrovsky, "Effective
Computations on Sliding Windows,"
SICOMP.
- Daniel Berend, Vladimir Braverman, "A
Linear Algorithm for Computing Convex Hulls for Random Lines,"
ACM Transactions on Algorithms
(TALG).
- Vladimir
Braverman, Rafail Ostrovsky, Carlo Zaniolo, "Optimal
sampling from sliding windows," PODS 2009, JCSS 2011.
- Vladimir
Braverman, Rafail Ostrovsky, "Smooth
histograms on sliding windows," FOCS 2007.
- Eitan
Bachmat, Vladimir Braverman,
"Batched disk scheduling
with delays," SIGMETRICS Performance Evaluation Review, 2006.
- Daniel Berend, Vladimir Braverman, "Convex
hull for intersections of random lines,"
AofA 2005.