No. Title Author Year
1 Efficient Differentially Private F₀ Linear Sketching Pagh, Rasmus et al. 2021
2 Front Matter, Table of Contents, Preface, Conference Organization Mutzel, Petra et al. 2021
3 LIPIcs, Volume 204, ESA 2021, Complete Volume Mutzel, Petra et al. 2021
4 Pure Differentially Private Summation from Anonymous Messages Ghazi, Badih et al. 2020
5 The Space Complexity of Inner Product Filters Pagh, Rasmus et al. 2020
6 Hardness of Bichromatic Closest Pair with Jaccard Similarity Pagh, Rasmus et al. 2019
7 PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors Aumüller, Martin et al. 2019
8 Hardness and Approximation of High-Dimensional Search Problems (Invited Talk) Pagh, Rasmus 2017
9 Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons Gudmundsson, Joachim et al. 2017
10 Theory and Applications of Hashing (Dagstuhl Seminar 17181) Dietzfelbinger, Martin et al. 2017
11 Front Matter, Table of Contents, Preface, Program Committee, Subreviewers Pagh, Rasmus 2016
12 LIPIcs, Volume 53, SWAT'16, Complete Volume Pagh, Rasmus 2016
13 Large-Scale Similarity Joins With Guarantees (Invited Talk) Pagh, Rasmus 2015
Current Page :
Number of result pages: 1
Number of documents: 13

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI