25 citations · 43 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CR2015★ 25 cited
Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions
Sofya Raskhodnikova, Adam Smith
Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for…
cs.DM2015
On the readability of overlap digraphs
Rayan Chikhi, Paul Medvedev, Martin Milanic +1
We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique stri…