Separations and equivalences between turnstile streaming and linear sketching

DOI10.1145/3357713.3384278OpenAlexW3034696818MaRDI QIDQ5145006

John Kallaugher, Eric Price

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.02358

zbMATH Keywords

sketchinggraph algorithmslinear algebrabig datasublinear algorithmsstreaming

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A Framework for Adversarially Robust Streaming Algorithms ⋮ Optimal lower bounds for matching and vertex cover in dynamic graph streams

This page was built for publication: Separations and equivalences between turnstile streaming and linear sketching