New differentially private turnstile-stream algorithms count distinct elements with O~(T^{1/3}) space and error, and a nearly matching lower bound for blocklisting-based methods.
25 B Additional details on KSET We describe the TESTSINGLETON data structure (Algorithm 6) which is a building block of the KSET data structure in more detail
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
New differentially private turnstile-stream algorithms count distinct elements with O~(T^{1/3}) space and error, and a nearly matching lower bound for blocklisting-based methods.