Zero-one frequency laws

DOI10.1145/1806689.1806729zbMath1293.68095OpenAlexW2040088116MaRDI QIDQ2875154

Rafail Ostrovsky, Vladimir Braverman

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806729

zbMATH Keywords

randomized algorithmstheory of computationdata streams

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (5)

Sketching and Embedding are Equivalent for Norms ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Continuous Monitoring of l_p Norms in Data Streams ⋮ Tight Bounds for the Subspace Sketch Problem with Applications

This page was built for publication: Zero-one frequency laws