Vladimir Braverman

I am a Ph.D. candidate at UCLA; my advisor is Rafail Ostrovsky. My main interests are algorithms for data streams, communication complexity and related areas. I received my B.Sc. and M.Sc. degrees from Ben-Gurion University, Israel, where my advisor was Daniel Berend. Prior to attending UCLA, I led a research team at HyperRoll, working with Yossi Matias.

Publications:

• Vladimir Braverman, Rafail Ostrovsky, "Measuring Independence of Datasets", Accepted to the 42th ACM Symposium on Theory of Computing (STOC 2010).
• Vladimir Braverman, Rafail Ostrovsky, "Zero-One Frequency Laws", Accepted to the 42th ACM Symposium on Theory of Computing (STOC 2010).
• Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky, "AMS Without 4-Wise Independence on Product Domains ", Accepted to the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010) .
• Vladimir Braverman, Rafail Ostrovsky, "Effective Computations on Sliding Windows", Accepted to SIAM Journal on Computing (SICOMP).
• Daniel Berend, Vladimir Braverman, "A Linear Algorithm for Computing Convex Hulls for Random Lines", Accepted to ACM Transactions on Algorithms.
• Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo, "Optimal sampling from sliding windows", PODS 2009.
• 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.
• Vladimir Braverman, "On two problems regarding random geometric structures" , M.Sc. Thesis.

Talks:

• "Streaming Computations on Sliding Windows"

• "Optimal Sampling from Sliding Windows"

Contact: vova at cs.ucla.edu