Turnstile streaming algorithms might as well be linear sketches

DOI10.1145/2591796.2591812zbMath1315.68281OpenAlexW2053182026MaRDI QIDQ5259551

Huy L. Nguyen, Yi Li, David P. Woodruff

Publication date: 26 June 2015

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

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

zbMATH Keywords

lower boundscommunication complexitystreaming algorithmslinear sketches

Mathematics Subject Classification ID

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

Related Items (16)

Sketching and Embedding are Equivalent for Norms ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ The Simultaneous Communication of Disjointness with Applications to Data Streams ⋮ Sublinear Estimation of Weighted Matchings in Dynamic Data Streams ⋮ Maximum Matching in Turnstile Streams ⋮ A Framework for Adversarially Robust Streaming Algorithms ⋮ Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ Approximate F_2-Sketching of Valuation Functions ⋮ Deterministic Heavy Hitters with Sublinear Query Time ⋮ Unnamed Item ⋮ Querying a Matrix Through Matrix-Vector Products. ⋮ Optimal lower bounds for matching and vertex cover in dynamic graph streams ⋮ Optimality of linear sketching under modular updates ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ On Approximating Matrix Norms in Data Streams ⋮ Perfect $L_p$ Sampling in a Data Stream

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography

This page was built for publication: Turnstile streaming algorithms might as well be linear sketches