Fetching the paper…
Reading the bibliography…
In the adversarially robust streaming model, a stream of elements is presented to an algorithm and is allowed to depend on the output of the algorithm at earlier times during the stream.
One-dimensional stable distributions
Vladimir M. Zolotarev · 1989
Earlier work this paper cites.
The space complexity of approximating the frequency moments
Noga Alon, Yossi Matias, and Mario Szegedy · 1999
Earlier work this paper cites.
Tracking join and self-join sizes in limited storage
Noga Alon, Phillip B. Gibbons, Yossi Matias, and Mario Szegedy · 2002
Earlier work this paper cites.
Models and issues in data stream systems
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, and Jennifer Widom · 2002
Earlier work this paper cites.
Counting distinct elements in a data stream
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan · 2002
Earlier work this paper cites.
Counting distinct elements in a data stream
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan · 2002
Earlier work this paper cites.
Fast mining of massive tabular data via approximate distance computations
Graham Cormode, Piotr Indyk, Nick Koudas, and S. Muthukrishnan · 2002
Earlier work this paper cites.
Maintaining stream statistics over sliding windows
Mayur Datar, Aristides Gionis, Piotr Indyk, and Rajeev Motwani · 2002
Earlier work this paper cites.
An approximate l1-difference algorithm for massive data streams
Joan Feigenbaum, Sampath Kannan, Martin Strauss, and Mahesh Viswanathan · 2002
Earlier work this paper cites.
Near-optimal lower bounds on the multi-party communication complexity of set disjointness
Amit Chakrabarti, Subhash Khot, and Xiaodong Sun · 2003
Earlier work this paper cites.
Tight lower bounds for the distinct elements problem
Piotr Indyk and David P. Woodruff · 2003
Earlier work this paper cites.
Sketch-based change detection: methods, evaluation, and applications
Balachander Krishnamurthy, Subhabrata Sen, Yin Zhang, and Yan Chen · 2003
Earlier work this paper cites.
Stable distributions: models for heavy-tailed data
John Nolan · 2003
Earlier work this paper cites.
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar · 2004
Earlier work this paper cites.
Algorithms for dynamic geometric problems over data streams
Piotr Indyk · 2004
Earlier work this paper cites.
Tabulation based 4-universal hashing with applications to second moment estimation
Mikkel Thorup and Yin Zhang · 2004
Earlier work this paper cites.
Optimal space lower bounds for all frequency moments
David P. Woodruff · 2004
Earlier work this paper cites.
What’s new: finding significant differences in network data streams
Graham Cormode and S. Muthukrishnan · 2005
Earlier work this paper cites.
Optimal approximations of the frequency moments of data streams
Piotr Indyk and David P. Woodruff · 2005
Earlier work this paper cites.
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Piotr Indyk · 2006
Earlier work this paper cites.
Maintaining significant stream statistics over sliding windows
Lap-Kei Lee and H. F. Ting · 2006
Earlier work this paper cites.
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
Lap-Kei Lee and H. F. Ting · 2006
Earlier work this paper cites.
Smooth histograms for sliding windows
Vladimir Braverman and Rafail Ostrovsky · 2007
Earlier work this paper cites.
The sliding-window computation model and results
Mayur Datar and Rajeev Motwani · 2007
Earlier work this paper cites.
Streaming in a connected world: querying and tracking distributed data streams
Graham Cormode and Minos N. Garofalakis · 2008
Earlier work this paper cites.
Sketching and streaming entropy via approximation theory
Nicholas J. A. Harvey, Jelani Nelson, and Krzysztof Onak · 2008
Earlier work this paper cites.
Robust submodular observation selection
Andreas Krause, H Brendan McMahan, Carlos Guestrin, and Anupam Gupta · 2008
Earlier work this paper cites.
Estimators and tail bounds for dimension reduction in ℓ α \ell_{\alpha} ( 0 < p ≤ 2 0<p\leq 2 ) using stable random projections
Ping Li · 2008
Earlier work this paper cites.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Earlier work this paper cites.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Earlier work this paper cites.
The data stream space complexity of cascaded norms
T. S. Jayram and David P. Woodruff · 2009
Cited alongside, same era.
Coresets and sketches for high dimensional subspace approximation problems
Dan Feldman, Morteza Monemizadeh, Christian Sohler, and David P. Woodruff · 2010
Cited alongside, same era.
On the exact space complexity of sketching and streaming small norms
Daniel M. Kane, Jelani Nelson, and David P. Woodruff · 2010
Cited alongside, same era.
An optimal algorithm for the distinct elements problem
Daniel M. Kane, Jelani Nelson, and David P. Woodruff · 2010
Cited alongside, same era.
1-pass relative-error l p l_{p} -sampling with applications
Morteza Monemizadeh and David P. Woodruff · 2010
Cited alongside, same era.
Streaming algorithms via precision sampling
Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak · 2011
Cited alongside, same era.
Submodular maximization over sliding windows
Jiecao Chen, Huy L. Nguyen, and Qin Zhang · 2016
Later among the works it cites.
Matrix sketching over sliding windows
Zhewei Wei, Xuancheng Liu, Feifei Li, Shuo Shang, Xiaoyong Du, and Ji-Rong Wen · 2016
Later among the works it cites.
Bptree: An ℓ 2 \ell_{2} heavy hitters algorithm using constant memory
Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, and David P. Woodruff · 2017
Later among the works it cites.
Continuous monitoring of ℓ p \ell_{p} norms in data streams
Jaroslaw Blasiok, Jian Ding, and Jelani Nelson · 2017
Later among the works it cites.
Robust submodular maximization: A non-uniform partitioning approach
Ilija Bogunovic, Slobodan Mitrovic, Jonathan Scarlett, and Volkan Cevher · 2017
Later among the works it cites.
Submodular optimization over sliding windows
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Polynomial estimators for high frequency moments
Sumit Ganguly · 2011
Cited alongside, same era.
Tight bounds for lp samplers, finding duplicates in streams, and related problems
Hossein Jowhari, Mert Sa 𝐮 \mathbf{u} glam, and Gábor Tardos · 2011
Cited alongside, same era.
Fast moment estimation in data streams in optimal space
Daniel M. Kane, Jelani Nelson, Ely Porat, and David P. Woodruff · 2011
Cited alongside, same era.
Sketching in adversarial environments
Ilya Mironov, Moni Naor, and Gil Segev · 2011
Cited alongside, same era.
(1 + eps)-approximate sparse recovery
Eric Price and David P. Woodruff · 2011
Cited alongside, same era.
Optimal sampling from sliding windows
Vladimir Braverman, Rafail Ostrovsky, and Carlo Zaniolo · 2012
Cited alongside, same era.
Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, and Morteza Zadimoghaddam · 2017
Later among the works it cites.
Streaming robust submodular maximization: A partitioned thresholding approach
Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, and Volkan Cevher · 2017
Later among the works it cites.
Near optimal linear algebra in the online and sliding window models
Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, and Samson Zhou · 2018
Later among the works it cites.
Nearly optimal distinct elements and heavy hitters on sliding windows
Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, and Samson Zhou · 2018
Later among the works it cites.
Pseudorandomness via the discrete fourier transform
Parikshit Gopalan, Daniel M. Kane, and Raghu Meka · 2018
Later among the works it cites.
High probability frequency moment sketches
Sumit Ganguly and David P. Woodruff · 2018
Later among the works it cites.
High probability frequency moment sketches
Sumit Ganguly and David P. Woodruff · 2018
Later among the works it cites.
Perfect l p l_{p} sampling in a data stream
Rajesh Jayaram and David P. Woodruff · 2018
Later among the works it cites.
Improved algorithms for adaptive compressed sensing
Vasileios Nakos, Xiaofei Shi, David P. Woodruff, and Hongyang Zhang · 2018
Later among the works it cites.
Robust monotone submodular function maximization
James B. Orlin, Andreas S. Schulz, and Rajan Udwani · 2018
Later among the works it cites.
Distributed statistical estimation of matrix products with applications
David P. Woodruff and Qin Zhang · 2018
Later among the works it cites.
Adversarially robust submodular maximization under knapsack constraints
Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, and Samson Zhou · 2019
Later among the works it cites.
Adversarially robust property-preserving hash functions
Elette Boyle, Rio LaVigne, and Vinod Vaikuntanathan · 2019
Later among the works it cites.
Bloom filters in adversarial environments
Moni Naor and Eylon Yogev · 2019
Later among the works it cites.
Streaming complexity of svms
Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, and David P. Woodruff · 2020
Closest in time.
Sliding window algorithms for k-clustering problems
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, and Morteza Zadimoghaddam · 2020
Closest in time.
A framework for adversarially robust streaming algorithms
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, and Eylon Yogev · 2020
Closest in time.
Optimal streaming and tracking distinct elements with high probability
Jaroslaw Blasiok · 2020
Closest in time.
The adversarial robustness of sampling
Omri Ben-Eliezer and Eylon Yogev · 2020
Closest in time.
Adversarially robust streaming algorithms via differential privacy
Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, and Uri Stemmer · 2020
Closest in time.
Non-adaptive adaptive sampling on turnstile streams
Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, and Samson Zhou · 2020
Closest in time.
A framework for adversarial streaming via differential privacy and difference estimators
Idan Attias, Edith Cohen, Moshe Shechner, and Uri Stemmer · 2021
Closest in time.
Separating adaptive streaming from oblivious streaming
Haim Kaplan, Yishay Mansour, Kobbi Nissim, and Uri Stemmer · 2021
Closest in time.
Separations for estimating large frequency moments on data streams
David P. Woodruff and Samson Zhou · 2021
Closest in time.