Robust streaming against low-memory adversaries
From MaRDI portal
Cites work
- A framework for adversarial streaming via differential privacy and difference estimators
- A Framework for Adversarially Robust Streaming Algorithms
- A strong separation for adversarially robust _0 estimation for linear sketches
- Adversarially robust streaming algorithms via differential privacy
- Adversarially robust streaming via dense-sparse trade-offs
- An Optimal Algorithm for Triangle Counting in the Stream
- Data streams: algorithms and applications.
- Finding frequent items in data streams
- Finding missing items requires strong forms of randomness
- How robust are linear sketches to adaptive inputs?
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- scientific article; zbMATH DE number 7829339 (Why is no real title available?)
- On the exact space complexity of sketching and streaming small norms
- Relaxed models for adversarial streaming: the bounded interruptions model and the advice model
- Separating adaptive streaming from oblivious streaming using the bounded storage model
- Streaming algorithms for the missing item finding problem
- Tight bounds for adversarially robust streams and sliding windows via difference estimators
- Turnstile streaming algorithms might as well be linear sketches
This page was built for publication: Robust streaming against low-memory adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445529)