Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons., and . ISAAC, volume 92 of LIPIcs, page 42:1-42:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Hardness and Approximation of High-Dimensional Search Problems (Invited Talk).. MFCS, volume 83 of LIPIcs, page 83:1-83:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Large-Scale Similarity Joins With Guarantees (Invited Talk).. ICDT, volume 31 of LIPIcs, page 15-24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Simple multi-party set reconciliation., and . Distributed Comput., 31 (6): 441-453 (2018)Practical perfect hashing in nearly optimal space., , and . Inf. Syst., 38 (1): 108-131 (2013)Optimal time-space trade-offs for non-comparison-based sorting., and . SODA, page 9-18. ACM/SIAM, (2002)Linear Probing with Constant Independence, , and . CoRR, (2006)Is min-wise hashing optimal for summarizing set intersection?, , and . PODS, page 109-120. ACM, (2014)Secondary indexing in one dimension: beyond b-trees and bitmap indexes., and . PODS, page 177-186. ACM, (2009)Set Similarity Search Beyond MinHash., and . CoRR, (2016)