1 citations · 1 across the 10 of their papers we have counts for
7 papers · 1 filter
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 where is a set of vertices, is a set of …
Streaming Private Continual Counting via Binning
Joel Daniel Andersson, Rasmus Pagh
In differential privacy, refers to problems in which we wish to continuously release a function of a dataset that is revealed one element at a time…
Faster Private Minimum Spanning Trees
Rasmus Pagh, Lukas Retschmeier
Motivated by applications in clustering and synthetic data generation, we consider the problem of releasing a minimum spanning tree (MST) under edge-weight differential privacy con…
Count on Your Elders: Laplace vs Gaussian Noise
Joel Daniel Andersson, Rasmus Pagh, Teresa Anna Steiner +1
In recent years, Gaussian noise has become a popular tool in differentially private algorithms, often replacing Laplace noise which dominated the early literature. Gaussian noise i…
Continual Counting with Gradual Privacy Expiration
Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh +2
Differential privacy with gradual expiration models the setting where data items arrive in a stream and at a given time the privacy loss guaranteed for a data item seen at time…
Profile Reconstruction from Private Sketches
Hao Wu, Rasmus Pagh
Given a multiset of items from , the \emph{profile reconstruction} problem is to estimate, for , the fraction of items in $\mathca…
Aleph Filter: To Infinity in Constant Time
Niv Dayan, Ioana-Oriana Bercea, Rasmus Pagh
Filter data structures are widely used in various areas of computer science to answer approximate set-membership queries. In many applications, the data grows dynamically, requirin…