Fetching the paper…
Reading the bibliography…
Linear sketches have been widely adopted to process fast data streams, and they can be used to accurately answer frequency estimation, approximate top K items, and summarize data distributions.
Selection and sorting with limited storage
J Ian Munro and Mike S Paterson · 1980
Earlier work this paper cites.
Finding repeated elements
Jayadev Misra and David Gries · 1982
Earlier work this paper cites.
Space-efficient online computation of quantile summaries
Michael Greenwald and Sanjeev Khanna · 2001
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin Chen, and Martin Farach-Colton · 2002
Earlier work this paper cites.
How to summarize the universe: Dynamic maintenance of quantiles
Anna C Gilbert, Yannis Kotidis, S Muthukrishnan, and Martin J Strauss · 2002
Earlier work this paper cites.
Medians and beyond: new aggregation techniques for sensor networks
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, and Subhash Suri · 2004
Earlier work this paper cites.
An improved data stream summary: the count-min sketch and its applications
Graham Cormode and Shan Muthukrishnan · 2005
Earlier work this paper cites.
Efficient computation of frequent and top-k elements in data streams
Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi · 2005
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
Finding frequent items in data streams
Graham Cormode and Marios Hadjieleftheriou · 2008
Earlier work this paper cites.
Thread cooperation in multicore architectures for frequency counting over multiple data streams
Sudipto Das, Shyam Antony, Divyakant Agrawal, and Amr El Abbadi · 2009
Earlier work this paper cites.
Pan-private streaming algorithms
Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N Rothblum, and Sergey Yekhanin · 2010
Earlier work this paper cites.
Pan-private algorithms via statistics on sketches
Darakhshan Mir, Shan Muthukrishnan, Aleksandar Nikolov, and Rebecca N Wright · 2011
Earlier work this paper cites.
The johnson-lindenstrauss transform itself preserves differential privacy
Jeremiah Blocki, Avrim Blum, Anupam Datta, and Or Sheffet · 2012
Earlier work this paper cites.
Quantiles over data streams: an experimental study
Lu Wang, Ge Luo, Ke Yi, and Graham Cormode · 2013
Earlier work this paper cites.
The algorithmic foundations of differential privacy
Cynthia Dwork, Aaron Roth, et al · 2014
Earlier work this paper cites.
Improved concentration bounds for count-sketch
Gregory T Minton and Eric Price · 2014
Earlier work this paper cites.
Differentially private linear algebra in the streaming model
Jalaj Upadhyay · 2014
Earlier work this paper cites.
Rényi divergence and kullback-leibler divergence
Tim Van Erven and Peter Harremos · 2014
Earlier work this paper cites.
Efficient private statistics with succinct sketches
Luca Melis, George Danezis, and Emiliano De Cristofaro · 2015
Cited alongside, same era.
Concentrated differential privacy: Simplifications, extensions, and lower bounds
Mark Bun and Thomas Steinke · 2016
Cited alongside, same era.
Concentrated differential privacy
Cynthia Dwork and Guy N Rothblum · 2016
Cited alongside, same era.
Network monitoring as a streaming analytics problem
Arpit Gupta, Rüdiger Birkner, Marco Canini, Nick Feamster, Chris Mac-Stoker, and Walter Willinger · 2016
Cited alongside, same era.
Optimal quantile approximation in streams
Zohar Karnin, Kevin Lang, and Edo Liberty · 2016
Cited alongside, same era.
Fetchsgd: Communication-efficient federated learning with sketching
Daniel Rothchild, Ashwinee Panda, Enayat Ullah, Nikita Ivkin, Ion Stoica, Vladimir Braverman, Joseph Gonzalez, and Raman Arora · 2020
Later among the works it cites.
The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space
Adam Smith, Shuang Song, and Abhradeep Guha Thakurta · 2020
Later among the works it cites.
Optimal private median estimation under minimal distributional assumptions
Christos Tzamos, Emmanouil-Vasileios Vlatakis-Gkaragkounis, and Ilias Zadik · 2020
Later among the works it cites.
Cot: Decentralized elastic caches for cloud environments
Victor Zakhary, Lawrence Lim, Divyakant Agrawal, and Amr El Abbadi · 2020
Later among the works it cites.
Differentially private quantiles
Jennifer Gillenwater, Matthew Joseph, and Alex Kulesza · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
George Kingsley Zipf · 2016
Cited alongside, same era.
Macrobase: Prioritizing attention in fast data
Peter Bailis, Edward Gan, Samuel Madden, Deepak Narayanan, Kexin Rong, and Sahaana Suri · 2017
Cited alongside, same era.
The complexity of differential privacy
Salil Vadhan · 2017
Cited alongside, same era.
Differentially private robust low-rank approximation
Raman Arora, Jalaj Upadhyay, et al · 2018
Cited alongside, same era.
Improving the gaussian mechanism for differential privacy: Analytical calibration and optimal denoising
Borja Balle and Yu-Xiang Wang · 2018
Cited alongside, same era.
Data streams with bounded deletions
Rajesh Jayaram and David P Woodruff · 2018
Cited alongside, same era.
Answering range queries under local differential privacy
Graham Cormode, Tejas Kulkarni, and Divesh Srivastava · 2019
Cited alongside, same era.
Practical and private (deep) learning without sampling or shuffling
Peter Kairouz, Brendan McMahan, Shuang Song, Om Thakkar, Abhradeep Thakurta, and Zheng Xu · 2021
Later among the works it cites.
Countsketches, feature hashing and the median of three
Kasper Green Larsen, Rasmus Pagh, and Jakub Tětek · 2021
Later among the works it cites.
Efficient differentially private f0 linear sketching
Rasmus Pagh and Nina Mesing Stausholm · 2021
Later among the works it cites.
Improved differentially private euclidean distance approximation
Nina Mesing Stausholm · 2021
Later among the works it cites.
Kll± approximate quantile sketches over dynamic datasets
Fuheng Zhao, Sujaya Maiyya, Ryan Wiener, Divyakant Agrawal, and Amr El Abbadi · 2021
Later among the works it cites.
https://catalog.caida.org/details/dataset/passive_2015_pcap
Anonymized internet traces 2015 · 2022
Closest in time.
Bounded space differentially private quantiles
Daniel Alabi, Omri Ben-Eliezer, and Anamay Chaturvedi · 2022
Closest in time.
Current trends in data summaries
Graham Cormode · 2022
Closest in time.
(nearly) all cardinality estimators are differentially private
Charlie Dickens, Justin Thaler, and Daniel Ting · 2022
Closest in time.
Improved utility analysis of private countsketch
Rasmus Pagh and Mikkel Thorup · 2022
Closest in time.
Offline reinforcement learning with differential privacy
Dan Qiao and Yu-Xiang Wang · 2022
Closest in time.
Sample-efficient reinforcement learning with loglog(T) switching cost
Dan Qiao, Ming Yin, Ming Min, and Yu-Xiang Wang · 2022
Closest in time.
Spacesaving±: An optimal algorithm for frequency estimation and frequent items in the bounded-deletion model
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, and Ahmed Metwally · 2022
Closest in time.