| No. |
Title |
Author |
Year |
| 1 |
Lower Bounds for Pseudo-Deterministic Counting in a Stream |
Braverman, Vladimir et al. |
2023 |
| 2 |
Private Data Stream Analysis for Universal Symmetric Norm Estimation |
Braverman, Vladimir et al. |
2023 |
| 3 |
Improved Algorithms for Time Decay Streams |
Braverman, Vladimir et al. |
2019 |
| 4 |
Streaming Coreset Constructions for M-Estimators |
Braverman, Vladimir et al. |
2019 |
| 5 |
The One-Way Communication Complexity of Dynamic Time Warping Distance |
Braverman, Vladimir et al. |
2019 |
| 6 |
Approximate Convex Hull of Data Streams |
Blum, Avrim et al. |
2018 |
| 7 |
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows |
Braverman, Vladimir et al. |
2018 |
| 8 |
Revisiting Frequency Moment Estimation in Random Order Streams |
Braverman, Vladimir et al. |
2018 |
| 9 |
Approximating Subadditive Hadamard Functions on Implicit Matrices |
Braverman, Vladimir et al. |
2016 |
| 10 |
Clustering on Sliding Windows in Polylogarithmic Space |
Braverman, Vladimir et al. |
2015 |
| 11 |
Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums |
Braverman, Vladimir et al. |
2015 |
| 12 |
Zero-One Laws for Sliding Windows and Universal Sketches |
Braverman, Vladimir et al. |
2015 |
| 13 |
An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits |
Braverman, Vladimir et al. |
2014 |
| 14 |
AMS Without 4-Wise Independence on Product Domains |
Braverman, Vladimir et al. |
2010 |
