Forty years of frequent items

DOI10.4171/icm2022/154OpenAlexW4389774987MaRDI QIDQ6198649

Jelani Nelson

Publication date: 20 March 2024

Published in: International Congress of Mathematicians (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/icm2022/154

zbMATH Keywords

sketchingdifferential privacyheavy hittersstreaming

Mathematics Subject Classification ID

Randomized algorithms (68W20) Theory of computing (68Q99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the boundedness of Bernoulli processes
• An information statistics approach to data stream and communication complexity
• Regularity of Gaussian processes
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Finding repeated elements
• Finding frequent items in data streams
• Suprema of Chaos Processes and the Restricted Isometry Property
• Local, Private, Efficient Protocols for Succinct Histograms
• Linear-time encodable and decodable error-correcting codes
• Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
• Random sampling with a reservoir
• An improved data stream summary: the count-min sketch and its applications
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• Communication Complexity
• For-All Sparse Recovery in Near-Optimal Time
• Heavy Hitters and the Structure of Local Privacy
• Beating CountSketch for heavy hitters in insertion streams
• Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
• Theory of Cryptography

This page was built for publication: Forty years of frequent items