The Data Stream Space Complexity of Cascaded Norms

DOI10.1109/FOCS.2009.82MaRDI QIDQ5171206zbMATH OpenOpenAlexFDO

Authors T. S. Jayram, David P. Woodruff

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/focs.2009.82

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(9)

• Streaming algorithms with one-sided estimation
• Estimating hybrid frequency moments of data streams
• Sketching and embedding are equivalent for norms
• Continuous monitoring of _p norms in data streams
• On sketching the \(q\) to \(p\) norms
• Deterministic heavy hitters with sublinear query time
• A Framework for Adversarially Robust Streaming Algorithms
• Towards Optimal Moment Estimation in Streaming and Distributed Models
• Towards Optimal Moment Estimation in Streaming and Distributed Models

This page was built for publication: The Data Stream Space Complexity of Cascaded Norms

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