Streaming Algorithms with One-Sided Estimation
From MaRDI portal
Publication:3088116
DOI10.1007/978-3-642-22935-0_37zbMath1343.68291MaRDI QIDQ3088116
David P. Woodruff, Joshua Brody
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_37
68Q25: Analysis of algorithms and problem complexity
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of the number of vertices of different degrees in a graph
- Data Streams: Algorithms and Applications
- Algorithms for dynamic geometric problems over data streams
- Forbidden Intersections
- An improved data stream summary: the count-min sketch and its applications
- Communication Complexity
- Efficient Sketches for Earth-Mover Distance, with Applications
- The Data Stream Space Complexity of Cascaded Norms
- Sublinear optimization for machine learning