Faster Update Time for Turnstile Streaming Algorithms

DOI10.1137/1.9781611975994.110MaRDI QIDQ5146891zbMATH OpenOpenAlexFDO

Authors Josh Alman, Huacheng Yu

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Time lower bounds for nonadaptive turnstile streaming algorithms
• Improved Algorithms for Time Decay Streams
• Turnstile streaming algorithms might as well be linear sketches
• Time bounds for streaming problems
• Streaming Algorithms for Data in Motion
• Fast timing-based algorithms
• Efficient sampling of non-strict turnstile data streams
• Efficient sampling of non-strict turnstile data streams
• More efficient parallel flow algorithms

Cited in

(2)

• Nearly time-optimal kernelization algorithms for the line-cover problem with big data
• Space limited linear-time graph algorithms on big data

This page was built for publication: Faster Update Time for Turnstile Streaming Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146891)