| Publication | Date of Publication | Type |
|---|
| Private data stream analysis for universal symmetric norm estimation | 2025-01-14 | Paper |
| Lower bounds for pseudo-deterministic counting in a stream | 2024-11-14 | Paper |
Coresets for clustering in excluded-minor graphs and beyond
(available as arXiv preprint) | 2024-01-15 | Paper |
Sublinear time spectral density estimation
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Symmetric norm estimation and regression on sliding windows
(available as arXiv preprint) | 2023-03-30 | Paper |
| scientific article; zbMATH DE number 7650129 (Why is no real title available?) | 2023-02-03 | Paper |
Improved Algorithms for Time Decay Streams
(available as arXiv preprint) | 2023-02-03 | Paper |
Universal streaming of subset norms
Theory of Computing | 2022-10-18 | Paper |
| scientific article; zbMATH DE number 7559216 (Why is no real title available?) | 2022-07-18 | Paper |
Metric \(k\)-median clustering in insertion-only streams
Discrete Applied Mathematics | 2021-09-30 | Paper |
Nearly optimal distinct elements and heavy hitters on sliding windows
(available as arXiv preprint) | 2021-08-04 | Paper |
Revisiting frequency moment estimation in random order streams
(available as arXiv preprint) | 2021-07-28 | Paper |
Approximate convex hull of data streams
(available as arXiv preprint) | 2021-07-28 | Paper |
The one-way communication complexity of dynamic time warping distance
(available as arXiv preprint) | 2021-03-17 | Paper |
Approximations of Schatten norms via Taylor expansions
(available as arXiv preprint) | 2019-10-22 | Paper |
Clustering problems on sliding windows
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Approximating subadditive Hadamard functions on implicit matrices
(available as arXiv preprint) | 2018-04-19 | Paper |
New bounds for the CLIQUE-GAP problem using graph decomposition theory
Algorithmica | 2018-04-06 | Paper |
| Streaming \(k\)-means on well-clusterable data | 2017-09-29 | Paper |
Beating CountSketch for heavy hitters in insertion streams
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Zero-one laws for sliding windows and universal sketches | 2017-08-31 | Paper |
Universal sketches for the frequency negative moments and other decreasing streaming sums
(available as arXiv preprint) | 2017-08-31 | Paper |
Streaming symmetric norms via measure concentration
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Clustering on sliding windows in polylogarithmic space | 2017-07-13 | Paper |
Accurate low-space approximation of metric \(k\)-median for insertion-only streams
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
| An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits | 2017-03-22 | Paper |
New bounds for the CLIQUE-GAP problem using graph decomposition theory
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Weighted sampling without replacement from data streams
Information Processing Letters | 2015-09-15 | Paper |
A linear algorithm for computing convex hulls for random lines
ACM Transactions on Algorithms | 2014-11-18 | Paper |
How to catch \(L_2\)-heavy-hitters on sliding windows
Theoretical Computer Science | 2014-10-06 | Paper |
Sampling from Dense Streams without Penalty
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Zero-one frequency laws
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Measuring independence of datasets
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Approximating Large Frequency Moments with Pick-and-Drop Sampling
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Generalizing the layering method of Indyk and Woodruff: recursive sketches for frequency-based vectors on streams
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
How hard is counting triangles in the streaming model?
Automata, Languages, and Programming | 2013-08-06 | Paper |
How to catch \(L _{2}\)-heavy-hitters on sliding windows
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Optimal sampling from sliding windows
Journal of Computer and System Sciences | 2012-05-11 | Paper |
| AMS without 4-wise independence on product domains | 2012-01-23 | Paper |
Effective computations on sliding windows
SIAM Journal on Computing | 2011-01-17 | Paper |
| Convex hull for intersections of random lines | 2006-08-29 | Paper |
