Data Stream Algorithms via Expander Graphs

DOI10.1007/978-3-540-92182-0_8zbMath1183.68750OpenAlexW1509908192MaRDI QIDQ3596706

Sumit Ganguly

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Related Items (3)

On Low-Risk Heavy Hitters and Sparse Recovery Schemes ⋮ Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications ⋮ Extended dynamic partial-overlapping batch means estimators for steady-state simulations

This page was built for publication: Data Stream Algorithms via Expander Graphs