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 authors' lower bounds match the Binary Tree Mechanism instantiated with Laplace noise, establishing its asymptotic optimality under both pure differential privacy and approximate differential privacy in the standard regime of $\delta \ll1/n$.

Charlie Harrison, Ethan Leeman · 3 citations · ⚡1

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