3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2026
A Fast Gaussian Mechanism under Continual Observation, with Applications
Rasmus Pagh, Sia Sejer
We consider the problem of privately releasing a -dimensional vector under updates: Starting with a zero vector, at times the vector is updated by adding $x^{(1…
cs.DS2013★ 3 cited
How to Approximate A Set Without Knowing Its Size In Advance
Rasmus Pagh, Gil Segev, Udi Wieder
The dynamic approximate membership problem asks to represent a set S of size n, whose elements are provided in an on-line fashion, supporting membership queries without false negat…