Streaming Algorithms with One-Sided Estimation

DOI10.1007/978-3-642-22935-0_37zbMath1343.68291OpenAlexW1622299928MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

One-Sided Error Communication Complexity of Gap Hamming Distance.

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

This page was built for publication: Streaming Algorithms with One-Sided Estimation