Back to authors
Rasmus Pagh
- Author ID
- 4564
- ORCID
-
0000-0002-1516-9306
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- IT University of Copenhagen
- Pagerank
- 0.10242613
- Overall Rank
- 661 | 96.86%
- Paper Count
- 14
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 14 of 14 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,183 |
The Input/Output Complexity of Triangle Enumeration |
2014 |
PODS |
9.0066814e-05 |
| 3,617 |
Scalable Computation of Acyclic Joins (Extended Abstract) |
2006 |
PODS |
7.2557398e-05 |
| 3,623 |
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions |
2020 |
PODS |
7.2463734e-05 |
| 3,795 |
Is Min-Wise Hashing Optimal for Summarizing Set Intersection? |
2014 |
PODS |
7.1200458e-05 |
| 3,806 |
On the Complexity of Inner Product Similarity Join |
2016 |
PODS |
7.108802e-05 |
| 4,960 |
InfiniFilter: Expanding Filters to Infinity and Beyond |
2023 |
SIGMOD |
6.4280133e-05 |
| 6,583 |
Distance-Sensitive Hashing |
2018 |
PODS |
5.8359922e-05 |
| 7,776 |
Aleph Filter: To Infinity in Constant Time |
2024 |
VLDB |
5.5464036e-05 |
| 9,317 |
Set Similarity Search for Skewed Data |
2018 |
PODS |
5.289545e-05 |
| 9,538 |
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation |
2025 |
PODS |
5.2528121e-05 |
| 10,295 |
Sublime: Sublinear Error & Space for Unbounded Skewed Streams |
2026 |
SIGMOD |
5.093636e-05 |
| 11,751 |
On the I/O Complexity of the k-Nearest Neighbors Problem |
2020 |
PODS |
5.093636e-05 |
| 12,490 |
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes |
2009 |
PODS |
5.093636e-05 |
| 13,703 |
Cache-Oblivious Hashing |
2010 |
PODS |
- |