Hao Wu

collaborators

2 papers

cs.DS2024

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation

Rasmus Pagh, Lukas Retschmeier, Hao Wu +1

We study the problem of privately releasing an approximate minimum spanning tree (MST). Given a graph $G = (V, E, W)$ where $V$ is a set of $n$ vertices, $E$ is a set of $m$ …

cs.CR2024

Profile Reconstruction from Private Sketches

Hao Wu, Rasmus Pagh

Given a multiset of $n$ items from $D$ , the \emph{profile reconstruction} problem is to estimate, for $t = 0, 1, \dots, n$ , the fraction $f [t]$ of items in $\mathca…