( en | de | ru )

 

Disambiguation of "Pagh, Rasmus"

Author of the publication

copydeleteadd this publication to your clipboard
Theory and Practise of Monotone Minimal Perfect Hashing.

, , , and . ALENEX, page 132-144. SIAM, (2009)

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.

Rasmus Lindstrot

Exploitation of the MERIS oxygen A band channel for the retrieval of cloud top pressure and the correction of instrumental stray light. FU Berlin, (2009)

Rasmus Fischer

Rasmus Thamsen

Rasmus Wegener

Rasmus Renziehausen

 

Other publications of authors with the same name

Secondary indexing in one dimension: beyond b-trees and bitmap indexes., and . PODS, page 177-186. ACM, (2009)Is min-wise hashing optimal for summarizing set intersection?, , and . PODS, page 109-120. ACM, (2014)Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time.. ICALP, volume 1644 of Lecture Notes in Computer Science, page 595-604. Springer, (1999)Simple and Space-Efficient Minimal Perfect Hash Functions., , and . WADS, volume 4619 of Lecture Notes in Computer Science, page 139-150. Springer, (2007)Distance-Sensitive Hashing., , , and . PODS, page 89-104. ACM, (2018)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)Uniform hashing in constant time and linear space, and . STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, page 622--628. New York, NY, USA, ACM, (2003)