Proves that the binary tree mechanism achieves the asymptotically optimal expected l_infty error of Theta(log^{3/2} n) for approximate DP continual counting.
Differentially private algorithms for graphs under continual observation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting
Proves that the binary tree mechanism achieves the asymptotically optimal expected l_infty error of Theta(log^{3/2} n) for approximate DP continual counting.