Tight lower bounds for the distinct elements problem

DOI10.1109/SFCS.2003.1238202MaRDI QIDQ7255185zbMATH OpenFDO

Authors Piotr Indyk, David P. Woodruff

Publication date 29 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2003.1238202

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(2)

• Optimal communication complexity of chained index
• Probabilistic counters for privacy preserving data aggregation

This page was built for publication: Tight lower bounds for the distinct elements problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255185)