A Framework for Adversarially Robust Streaming Algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4214161 (Why is no real title available?)
- scientific article; zbMATH DE number 5081837 (Why is no real title available?)
- scientific article; zbMATH DE number 6789285 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- scientific article; zbMATH DE number 7711619 (Why is no real title available?)
- A Tight Lower Bound for High Frequency Moment Estimation with Small Error
- Adversarial laws of large numbers and optimal regret in online classification
- An information statistics approach to data stream and communication complexity
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Continuous monitoring of _p norms in data streams
- Data streams: algorithms and applications.
- Deterministically Estimating Data Stream Frequencies
- Differential privacy under continual observation
- Finding frequent items in data streams
- Finding repeated elements
- High probability frequency moment sketches
- How robust are linear sketches to adaptive inputs?
- Modern computer algebra
- On the exact space complexity of sketching and streaming small norms
- Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error
- Optimal space lower bounds for all frequency moments
- Pseudo-Deterministic Streaming.
- Separating adaptive streaming from oblivious streaming using the bounded storage model
- Separations and equivalences between turnstile streaming and linear sketching
- Sketching in Adversarial Environments
- Sublinear algorithms for ( + 1) vertex coloring
- The Data Stream Space Complexity of Cascaded Norms
- The best constants in the Khintchine inequality
- The space complexity of approximating the frequency moments
- Towards Optimal Moment Estimation in Streaming and Distributed Models
- Turnstile streaming algorithms might as well be linear sketches
Cited in
(7)- Streaming graph algorithms in the massively parallel computation model
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Property-preserving hash functions for Hamming distance from standard assumptions
- Relative error streaming quantiles
- A framework for adversarial streaming via differential privacy and difference estimators
- Mirror games against an open book player
- Adversarially robust streaming algorithms via differential privacy
This page was built for publication: A Framework for Adversarially Robust Streaming Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066953)
