Rasmus Pagh
Professor
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
I'm professor at the computer science department at University of Copenhagen, Denmark. I received my PhD in 2002 from BRICS at the Department of Computer Science, Aarhus University, supervised by Peter Bro Miltersen, and worked at IT University of Copenhagen 2002-2020. My scientific interests are within algorithms and data structures, with an emphasis on big data. I have worked extensively on basic questions in information retrieval and the role of randomness in computing, on problems with applications in databases and knowledge discovery, and on the exploitation of parallelism in modern computer architectures. I recently concluded an ERC-funded project on Scalable Similarity Search. I am also a core researcher at the BARC center for basic algorithms research. January 2019 to December 202 I was a visiting faculty researcher at Google Research.
ID: 252282120
Most downloads
-
24
downloads
Efficient differentially private F0 linear sketching
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
12
downloads
Fair near neighbor search via sampling
Research output: Contribution to journal › Journal article › Research › peer-review
Published -
12
downloads
DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published