scientific article; zbMATH DE number 6469142

zbMath1317.68266MaRDI QIDQ5501253

Ravi Kumar, Don Coppersmith

Publication date: 3 August 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (8)

The Simultaneous Communication of Disjointness with Applications to Data Streams ⋮ Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ Optimal sampling from sliding windows ⋮ Sublinear-time algorithms for counting star subgraphs via edge sampling ⋮ High Probability Frequency Moment Sketches ⋮ In-network estimation of frequency moments ⋮ Applying approximate counting for computing the frequency moments of long data streams ⋮ Hierarchical sampling from sketches: Estimating functions over data streams

This page was built for publication: