Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms

DOI10.1145/2746539.2746542zbMath1321.68286arXiv1407.2151OpenAlexW1983225054MaRDI QIDQ2941576

No author found.

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

heavy hittersstreamingtime lower boundscell probe modelpoint query

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (2)

Space limited linear-time graph algorithms on big data ⋮ Tracking the l_2 Norm with Constant Update Time

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms