2 papers
cs.DS2019
Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy
Adam Sealfon, Jonathan Ullman
We give a simple, computationally efficient, and node-differentially-private algorithm for estimating the parameter of an Erdos-Renyi graph---that is, estimating p in a G(n,p)---wi…
cs.DC2018
Population stability: regulating size in the presence of an adversary
Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro +1
We introduce a new coordination problem in distributed computing that we call the population stability problem. A system of agents each with limited memory and communication, as we…