3 citations · 5 across the 3 of their papers we have counts for
3 papers
Differentially Private Top-k Selection via Canonical Lipschitz Mechanism
Michael Shekelyan, Grigorios Loukides
Selecting the top- highest scoring items under differential privacy (DP) is a fundamental task with many applications. This work presents three new results. First, the exponenti…
Weighted Random Sampling over Joins
Michael Shekelyan, Graham Cormode, Peter Triantafillou +2
Joining records with all other records that meet a linkage condition can result in an astronomically large number of combinations due to many-to-many relationships. For such challe…
ParetoPrep: Fast computation of Path Skylines Queries
Michael Shekelyan, Gregor Jossé, Matthias Schubert
Computing cost optimal paths in network data is a very important task in many application areas like transportation networks, computer networks or social graphs. In many cases, the…