| 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 | 2024-01-15 | Paper |
| Sublinear time spectral density estimation | 2023-12-08 | Paper |
| Symmetric norm estimation and regression on sliding windows | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875522 | 2023-02-03 | Paper |
| Improved Algorithms for Time Decay Streams | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5040832 | 2022-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088943 | 2022-07-18 | Paper |
| Metric \(k\)-median clustering in insertion-only streams | 2021-09-30 | Paper |
| Nearly optimal distinct elements and heavy hitters on sliding windows | 2021-08-04 | Paper |
| Revisiting frequency moment estimation in random order streams | 2021-07-28 | Paper |
| Approximate convex hull of data streams | 2021-07-28 | Paper |
| The one-way communication complexity of dynamic time warping distance | 2021-03-17 | Paper |
| Approximations of Schatten norms via Taylor expansions | 2019-10-22 | Paper |
| Clustering problems on sliding windows | 2018-07-16 | Paper |
| Approximating subadditive Hadamard functions on implicit matrices | 2018-04-19 | Paper |
| New bounds for the CLIQUE-GAP problem using graph decomposition theory | 2018-04-06 | Paper |
| Streaming \(k\)-means on well-clusterable data | 2017-09-29 | Paper |
| Beating CountSketch for heavy hitters in insertion streams | 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 | 2017-08-31 | Paper |
| Streaming symmetric norms via measure concentration | 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 | 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 | 2015-09-16 | Paper |
| Weighted sampling without replacement from data streams | 2015-09-15 | Paper |
| A linear algorithm for computing convex hulls for random lines | 2014-11-18 | Paper |
| How to catch \(L_2\)-heavy-hitters on sliding windows | 2014-10-06 | Paper |
| Sampling from Dense Streams without Penalty | 2014-09-26 | Paper |
| Zero-one frequency laws | 2014-08-13 | Paper |
| Measuring independence of datasets | 2014-08-13 | Paper |
| Approximating Large Frequency Moments with Pick-and-Drop Sampling | 2013-10-04 | Paper |
| Generalizing the layering method of Indyk and Woodruff: recursive sketches for frequency-based vectors on streams | 2013-10-04 | Paper |
| How hard is counting triangles in the streaming model? | 2013-08-06 | Paper |
| How to catch \(L _{2}\)-heavy-hitters on sliding windows | 2013-06-11 | Paper |
| Optimal sampling from sliding windows | 2012-05-11 | Paper |
| AMS without 4-wise independence on product domains | 2012-01-23 | Paper |
| Effective computations on sliding windows | 2011-01-17 | Paper |
| Convex hull for intersections of random lines | 2006-08-29 | Paper |
