Author

Ethan Leeman

h-index 5 View on Semantic Scholar

We have 2 of 12 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Tight Lower Bounds for Differentially Private Continual Counting

The Binary Tree Mechanism is a standard algorithm for differentially private continual counting, but its asymptotic optimality under pure differential privacy has remained unresolved since its introduction. We resolve this question. For fixed $0<\varepsilon \le 1$, we prove asymptotically tight lower bounds of $\Omega(...

Charlie Harrison, Ethan Leeman · 0 citations

Preprint Aug 2026

Online Differentially Private Consistent Clustering

A generic reduction is given that transforms the (sensitive) input stream into a private stream, which is a semi-coreset of the input stream, which implies that any (non-private) online clustering algorithm, run as a post-processing step, can achieve good utility for the original clustering objective.

Edith Cohen, Vadym Doroshenko, Badih Ghazi et al. · 0 citations