default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRasmus Pagh
- > Home > Persons > Rasmus Pagh
Publications
- 2022
[j30]Rasmus Pagh:
Technical Perspective: Relative Error Streaming Quantiles. SIGMOD Rec. 51(1): 68 (2022)- 2019
- [r3]Rasmus Pagh:
Similarity Sketching. Encyclopedia of Big Data Technologies 2019 - 2018
- [j24]Rasmus Pagh
:
CoveringLSH: Locality-Sensitive Hashing without False Negatives. ACM Trans. Algorithms 14(3): 29:1-29:17 (2018) - 2017
- [c66]Rasmus Pagh:
Hardness and Approximation of High-Dimensional Search Problems (Invited Talk). MFCS 2017: 83:1-83:1 - 2016
- [c60]Rasmus Pagh:
Locality-sensitive Hashing without False Negatives. SODA 2016: 1-9 - [e1]Rasmus Pagh:
15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland. LIPIcs 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-011-8 [contents] - [r2]Rasmus Pagh:
Cuckoo Hashing. Encyclopedia of Algorithms 2016: 478-481 - 2015
- [c58]Rasmus Pagh:
Large-Scale Similarity Joins With Guarantees (Invited Talk). ICDT 2015: 15-24 - [i31]Rasmus Pagh:
Locality-sensitive Hashing without False Negatives. CoRR abs/1507.03225 (2015) - 2013
- [j14]Rasmus Pagh:
Compressed matrix multiplication. ACM Trans. Comput. Theory 5(3): 9:1-9:17 (2013) - 2012
- [c41]Rasmus Pagh:
Compressed matrix multiplication. ITCS 2012: 442-451 - 2011
- [i16]Rasmus Pagh:
Compressed Matrix Multiplication. CoRR abs/1108.1320 (2011) - 2009
- [j9]Rasmus Pagh:
Dispersing hash functions. Random Struct. Algorithms 35(1): 70-82 (2009) - 2008
- [r1]Rasmus Pagh:
Cuckoo Hashing. Encyclopedia of Algorithms 2008 - 2002
- [c11]Rasmus Pagh:
Basic External Memory Data Structures. Algorithms for Memory Hierarchies 2002: 14-35 - 2001
- [j2]Rasmus Pagh:
Low Redundancy in Static Dictionaries with Constant Query Time. SIAM J. Comput. 31(2): 353-363 (2001) - [c6]Rasmus Pagh:
On the cell probe complexity of membership and perfect hashing. STOC 2001: 425-432 - 2000
- [j1]Rasmus Pagh:
A Trade-Off for Worst-Case Efficient Dictionaries. Nord. J. Comput. 7(3): 151-163 (2000) - [c5]Rasmus Pagh:
Dispersing Hash Functions. ICALP Satellite Workshops 2000: 53-68 - [c4]Rasmus Pagh:
Faster deterministic dictionaries. SODA 2000: 487-493 - [c3]Rasmus Pagh:
A New Trade-Off for Deterministic Dictionaries. SWAT 2000: 22-31 - 1999
- [c2]Rasmus Pagh:
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. ICALP 1999: 595-604 - [c1]Rasmus Pagh:
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. WADS 1999: 49-54
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-24 00:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
