| Publication | Date of Publication | Type |
|---|
| Time-decayed correlated aggregates over data streams | 2024-11-21 | Paper |
| Towards a theory of parameterized streaming algorithms | 2023-02-03 | Paper |
| Efficient interactive proofs for linear algebra | 2023-02-03 | Paper |
| Independent sets in vertex-arrival streams | 2022-07-21 | Paper |
| PrivBayes. Private data release via Bayesian networks | 2021-11-25 | Paper |
| Lightweight query authentication on streams | 2021-11-25 | Paper |
| Streaming algorithms for bin packing and vector scheduling | 2021-09-28 | Paper |
| Correlation clustering in data streams | 2021-06-30 | Paper |
| Streaming algorithms for bin packing and vector scheduling | 2020-08-24 | Paper |
| Fast sketch-based recovery of correlation outliers | 2020-08-06 | Paper |
| On Unifying the Space of ℓ0-Sampling Algorithms | 2019-09-12 | Paper |
| Verifiable stream computation and Arthur-Merlin communication | 2019-09-02 | Paper |
| Annotations for Sparse Data Streams | 2019-06-20 | Paper |
| On the tradeoff between stability and fit | 2018-11-05 | Paper |
| Annotations in data streams | 2018-10-30 | Paper |
| Approximating the Caro-Wei bound for independent sets in graph streams | 2018-08-17 | Paper |
| Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601830 | 2018-01-24 | Paper |
| Parameterized Streaming: Maximal Matching and Vertex Cover | 2017-10-05 | Paper |
| A second look at counting triangles in graph streams (corrected) | 2017-05-22 | Paper |
| Corrigendum to: ``A second look at counting triangles in graph streams | 2017-05-22 | Paper |
| Robust lower bounds for communication and stream computation | 2016-11-01 | Paper |
| Practical verified computation with streaming interactive proofs | 2016-10-07 | Paper |
| Mergeable summaries | 2015-09-03 | Paper |
| A near-optimal algorithm for computing the entropy of a stream | 2014-12-18 | Paper |
| A near-optimal algorithm for estimating the entropy of a stream | 2014-11-18 | Paper |
| Substring compression problems | 2014-10-13 | Paper |
| A second look at counting triangles in graph streams | 2014-09-10 | Paper |
| Time-decaying sketches for sensor data aggregation | 2014-03-13 | Paper |
| Summary data structures for massive data | 2013-08-05 | Paper |
| Information cost tradeoffs for augmented index and streaming language recognition | 2013-07-04 | Paper |
| Streaming graph computations with a helpful advisor | 2013-03-05 | Paper |
| Synopses for massive data: samples, histograms, wavelets, sketches | 2012-08-10 | Paper |
| Time-decaying sketches for robust aggregation of sensor data | 2010-09-06 | Paper |
| Streaming graph computations with a helpful advisor | 2010-09-06 | Paper |
| Annotations in Data Streams | 2009-07-14 | Paper |
| On Estimating Frequency Moments of Data Streams | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302089 | 2009-01-05 | Paper |
| What's hot and what's not: tracking most frequent items dynamically | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952617 | 2000-05-10 | Paper |
