Vladimir Braverman, Ph.D.
Affiliations: | 2011 | University of California, Los Angeles, Los Angeles, CA |
Google:
"Vladimir Braverman"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Ivkin N, Liu Z, Yang LF, et al. (2018) Scalable streaming tools for analyzing N-body simulations : finding halos and investigating excursion sets in one pass. Astronomy and Computing. 23: 166-179 |
| Braverman V, Ostrovsky R, Roytman A. (2015) Zero-one laws for sliding windows and universal sketches Leibniz International Proceedings in Informatics, Lipics. 40: 573-590 |
| Braverman V, Ostrovsky R, Vorsanger G. (2015) Weighted sampling without replacement from data streams Information Processing Letters. 115: 923-926 |
| Braverman V, Gelles R, Ostrovsky R. (2014) How to catch L2-heavy-hitters on sliding windows Theoretical Computer Science. 554: 82-94 |
| Braverman V, Ostrovsky R. (2013) Generalizing the layering method of indyk and Woodruff: Recursive sketches for frequency-based vectors on streams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8096: 58-70 |
| Braverman V, Ostrovsky R. (2013) Approximating large frequency moments with pick-and-drop sampling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8096: 42-57 |
| Braverman V, Ostrovsky R, Vilenchik D. (2013) How hard is counting triangles in the streaming model? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 244-254 |
| Braverman V, Gelles R, Ostrovsky R. (2013) How to catch l 2-heavy-hitters on sliding windows Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7936: 638-650 |
| Braverman V, Ostrovsky R, Zaniolo C. (2012) Optimal sampling from sliding windows Journal of Computer and System Sciences. 78: 260-272 |
| Braverman V, Meyerson A, Ostrovsky R, et al. (2011) Streaming k-means on well-clusterable data Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 26-40 |