| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7829269 (Why is no real title available?)
| 2024-04-09 | Paper |
scientific article; zbMATH DE number 7758324 (Why is no real title available?)
| 2023-10-31 | Paper |
scientific article; zbMATH DE number 7650137 (Why is no real title available?)
| 2023-02-03 | Paper |
Vertex Ordering Problems in Directed Graph Streams
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Verifiable stream computation and Arthur-Merlin communication
SIAM Journal on Computing | 2019-09-02 | Paper |
Annotations for Sparse Data Streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Annotations in data streams
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Incidence geometries and the pass complexity of semi-streaming set cover
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6862103 (Why is no real title available?)
| 2018-04-19 | Paper |
A depth-five lower bound for iterated matrix multiplication
| 2018-01-24 | Paper |
scientific article; zbMATH DE number 6829278 (Why is no real title available?)
| 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
Algorithmica | 2016-11-29 | Paper |
Robust lower bounds for communication and stream computation
Theory of Computing | 2016-11-01 | Paper |
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Submodular maximization meets streaming: matchings, matroids, and more
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Beyond set disjointness
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 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
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
A near-optimal algorithm for estimating the entropy of a stream
ACM Transactions on Algorithms | 2014-11-18 | Paper |
An improved approximation algorithm for \textsc{Resource Allocation}
ACM Transactions on Algorithms | 2014-09-09 | Paper |
An optimal lower bound on the communication complexity of gap-Hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Submodular maximization meets streaming: matchings, matroids, and more
Lecture Notes in Computer Science | 2014-06-02 | Paper |
When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Information cost tradeoffs for augmented index and streaming language recognition
SIAM Journal on Computing | 2013-07-04 | Paper |
scientific article; zbMATH DE number 6146451 (Why is no real title available?)
| 2013-03-19 | Paper |
An optimal lower bound on the communication complexity of gap-Hamming-distance
SIAM Journal on Computing | 2013-02-04 | Paper |
Information complexity versus corruption and applications to orthogonality and gap-Hamming
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
The query complexity of estimating weighted averages
Acta Informatica | 2012-03-23 | Paper |
Everywhere-Tight Information Cost Tradeoffs for Augmented Index
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Combinatorial theorems about embedding trees on the real line
Journal of Graph Theory | 2011-06-07 | Paper |
An optimal randomized cell probe lower bound for approximate nearest neighbor searching
SIAM Journal on Computing | 2010-11-04 | Paper |
Better Gap-Hamming Lower Bounds via Better Round Elimination
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
scientific article; zbMATH DE number 5764792 (Why is no real title available?)
| 2010-08-06 | Paper |
Annotations in Data Streams
Automata, Languages and Programming | 2009-07-14 | Paper |
Functional Monitoring without Monotonicity
Automata, Languages and Programming | 2009-07-14 | Paper |
scientific article; zbMATH DE number 5485578 (Why is no real title available?)
| 2009-01-05 | Paper |
Nearly Private Information Retrieval
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Improved lower bounds on the randomized complexity of graph properties
Random Structures & Algorithms | 2007-05-11 | Paper |
Approximation algorithms for the unsplittable flow problem
Algorithmica | 2007-03-05 | Paper |
scientific article; zbMATH DE number 2209721 (Why is no real title available?)
| 2005-09-28 | Paper |
scientific article; zbMATH DE number 2086936 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1947047 (Why is no real title available?)
| 2003-07-07 | Paper |
scientific article; zbMATH DE number 1754599 (Why is no real title available?)
| 2002-06-12 | Paper |
Evasiveness of subgraph containment and related properties
SIAM Journal on Computing | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1688357 (Why is no real title available?)
| 2002-01-09 | Paper |
