2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2011
Iterative Constructions and Private Data Release
Anupam Gupta, Aaron Roth, Jonathan Ullman
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of existi…
cs.IT2011★ 2 cited
On the Zero-Error Capacity Threshold for Deletion Channels
Ian A. Kash, Michael Mitzenmacher, Justin Thaler +1
We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook consisting of strings of bits, and our mod…