This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Rasmus Pagh is a Danish computer scientist and a professor of computer science at the University of Copenhagen. His main work is in algorithms and data structures, and he is particularly known for the cuckoo hashing algorithm and for co-founding the Basic Algorithms Research Center, BARC, in Copenhagen.
Rasmus Pagh | |
|---|---|
| Born | 6 February 1975 (age 49) Denmark |
| Alma mater |
|
| Awards | |
| Scientific career | |
| Fields | |
| Institutions | |
| Thesis | Hashing, randomness and dictionaries |
| Doctoral advisor | Peter Bro Miltersen |
| Website | rasmuspagh |
Early life and education
editRasmus Pagh was born in Copenhagen,[1] but soon after his family moved to Esbjerg in western Denmark. He went to high school at Rødkilde Amtsgymnasium where he participated in the "JP Forsker" science competition, and in the "Georg Mohr" mathematics competition. After graduating in 1994, he went to study mathematics and computer science at Aarhus University. In 1998 he started his PhD with Peter Bro Miltersen and started writing articles about hashing and efficient dictionaries, culminating in his work on cuckoo hashing. Soon after his thesis defence was in the fall of 2002 he became an assistant professor at the recently founded IT University of Copenhagen.
Career
editIn 2007, Rasmus founded the Scalable Query Evaluation for Reliable Databases (SQERD) project. The project aimed at applying modern algorithmic techniques to problems arising in database management systems in connection with the evaluation of queries. From 2011-2015, he ran the MaDaMS project, which partnered with Demetra A/S, Aarhus University and Apptus AB at finding more efficient approaches to data mining.[2]
Rasmus Pagh was made full professor at ITU with his Inaugural Lecture in 2013.[3] In 2014, he received an ERC Consolidator Grant for a project on Scalable Similarity Search.[4][5] The project resulted in many new algorithms, including a way to prevent false negatives in high dimensional search.[6] In 2017 Pagh co-founded the Basic Algorithms Research Center, BARC, in Copenhagen[7] with Mikkel Thorup, Thore Husfeldt and Stephen Alstrup. Soon thereafter he took a sabbatical to join the Simons Institute at University of California, Berkeley[8] and become a Google visiting scholar.[9]
In 2019, Rasmus Pagh became an Associate Editor of the SIAM Journal on Computing.[10]
In 2020, Rasmus Pagh received the European Symposium on Algorithms Test-of-Time award for his 2001 work on cuckoo hashing with Flemming Friche Rodler.[11]
See also
editReferences
edit- ^ "About Rasmus". www.itu.dk.
- ^ "MaDaMS". sites.google.com.
- ^ Pagh, Rasmus (13 September 2013). "Inaugural Lecture" (PDF). itu.dk.
- ^ "On a mission to save search engines". 2014-03-12.
- ^ "Scalable Similarity Search".
- ^ "Søgning efter sorte huller".
- ^ "NYT københavnsk kraftcenter inden for algoritmeforskning". 2017-03-20.
- ^ "Rasmus Pagh | Simons Institute for the Theory of Computing". 27 February 2018.
- ^ "Rasmus Pagh (@RasmusPagh1) | Twitter". twitter.com.
- ^ "SICOMP | Editorial Board | SIAM". www.siam.org.
- ^ "ESA - European Symposium on Algorithms: ESA Test-of-Time Award 2020". European Symposia on Algorithms. Retrieved 2021-05-22.