The following pages link to Vladimir Braverman (Q414875):
Displaying 39 items.
- Optimal sampling from sliding windows (Q414877) (← links)
- Weighted sampling without replacement from data streams (Q495669) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Metric \(k\)-median clustering in insertion-only streams (Q2231758) (← links)
- Approximations of Schatten norms via Taylor expansions (Q2330553) (← links)
- Symmetric norm estimation and regression on sliding windows (Q2695322) (← links)
- Approximating Large Frequency Moments with Pick-and-Drop Sampling (Q2851847) (← links)
- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams (Q2851848) (← links)
- Measuring independence of datasets (Q2875153) (← links)
- Zero-one frequency laws (Q2875154) (← links)
- Sampling from Dense Streams without Penalty (Q2920441) (← links)
- A linear algorithm for computing convex hulls for random lines (Q2930268) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits (Q2969645) (← links)
- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams (Q2971636) (← links)
- Effective Computations on Sliding Windows (Q3068626) (← links)
- (Q3113742) (← links)
- Clustering Problems on Sliding Windows (Q4575678) (← links)
- Approximating Subadditive Hadamard Functions on Implicit Matrices. (Q4636458) (← links)
- How to Catch L 2-Heavy-Hitters on Sliding Windows (Q4925278) (← links)
- Streaming symmetric norms via measure concentration (Q4978018) (← links)
- Approximate Convex Hull of Data Streams (Q5002691) (← links)
- (Q5002695) (← links)
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
- (Q5040832) (← links)
- (Q5088943) (← links)
- Clustering on Sliding Windows in Polylogarithmic Space. (Q5275379) (← links)
- How Hard Is Counting Triangles in the Streaming Model? (Q5326565) (← links)
- Zero-One Laws for Sliding Windows and Universal Sketches (Q5351923) (← links)
- Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums (Q5351924) (← links)
- Beating CountSketch for heavy hitters in insertion streams (Q5361876) (← links)
- (Q5365019) (← links)
- (Q5485343) (← links)
- The one-way communication complexity of dynamic time warping distance (Q5854561) (← links)
- Improved Algorithms for Time Decay Streams (Q5875480) (← links)
- (Q5875522) (← links)
- Lower bounds for pseudo-deterministic counting in a stream (Q6638024) (← links)
- Private data stream analysis for universal symmetric norm estimation (Q6663062) (← links)
