| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126266 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062143 | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875530 | 2023-02-03 | Paper |
| Vertex Ordering Problems in Directed Graph Streams | 2021-02-02 | Paper |
| Verifiable stream computation and Arthur-Merlin communication | 2019-09-02 | Paper |
| Annotations for Sparse Data Streams | 2019-06-20 | Paper |
| Annotations in data streams | 2018-10-30 | Paper |
| Incidence geometries and the pass complexity of semi-streaming set cover | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636608 | 2018-04-19 | Paper |
| A depth-five lower bound for iterated matrix multiplication | 2018-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601830 | 2018-01-24 | Paper |
| On density, threshold and emptiness queries for intervals in the streaming model | 2017-07-13 | Paper |
| Certifying equality with limited interaction | 2017-03-22 | Paper |
| Certifying equality with limited interaction | 2016-11-29 | Paper |
| Robust lower bounds for communication and stream computation | 2016-11-01 | Paper |
| A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube | 2016-09-29 | Paper |
| Submodular maximization meets streaming: matchings, matroids, and more | 2015-12-09 | Paper |
| Beyond set disjointness | 2015-09-03 | Paper |
| A near-optimal algorithm for computing the entropy of a stream | 2014-12-18 | Paper |
| A quasi-PTAS for unsplittable flow on line graphs | 2014-11-25 | Paper |
| A near-optimal algorithm for estimating the entropy of a stream | 2014-11-18 | Paper |
| An improved approximation algorithm for \textsc{Resource Allocation} | 2014-09-09 | Paper |
| An optimal lower bound on the communication complexity of gap-Hamming-distance | 2014-06-05 | Paper |
| Submodular maximization meets streaming: matchings, matroids, and more | 2014-06-02 | Paper |
| When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks | 2014-05-13 | Paper |
| Information cost tradeoffs for augmented index and streaming language recognition | 2013-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910715 | 2013-03-19 | Paper |
| An optimal lower bound on the communication complexity of gap-Hamming-distance | 2013-02-04 | Paper |
| Information complexity versus corruption and applications to orthogonality and gap-Hamming | 2012-11-02 | Paper |
| The query complexity of estimating weighted averages | 2012-03-23 | Paper |
| Everywhere-Tight Information Cost Tradeoffs for Augmented Index | 2011-08-17 | Paper |
| Combinatorial theorems about embedding trees on the real line | 2011-06-07 | Paper |
| An optimal randomized cell probe lower bound for approximate nearest neighbor searching | 2010-11-04 | Paper |
| Better Gap-Hamming Lower Bounds via Better Round Elimination | 2010-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579381 | 2010-08-06 | Paper |
| Annotations in Data Streams | 2009-07-14 | Paper |
| Functional Monitoring without Monotonicity | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302089 | 2009-01-05 | Paper |
| Nearly Private Information Retrieval | 2008-09-17 | Paper |
| Improved lower bounds on the randomized complexity of graph properties | 2007-05-11 | Paper |
| Approximation algorithms for the unsplittable flow problem | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692703 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737541 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411277 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535024 | 2002-06-12 | Paper |
| Evasiveness of subgraph containment and related properties | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762499 | 2002-01-09 | Paper |
