Back to authors
Rasmus Pagh
- Author ID
- o0000-0002-1516-9306
- 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.10134267
- Overall Rank
- 679 | 96.87%
- 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,215 |
The Input/Output Complexity of Triangle Enumeration |
2014 |
PODS |
8.8194236e-05 |
| 3,660 |
Scalable Computation of Acyclic Joins (Extended Abstract) |
2006 |
PODS |
7.1218018e-05 |
| 3,690 |
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions |
2020 |
PODS |
7.0936701e-05 |
| 3,809 |
On the Complexity of Inner Product Similarity Join |
2016 |
PODS |
7.0089846e-05 |
| 3,858 |
Is Min-Wise Hashing Optimal for Summarizing Set Intersection? |
2014 |
PODS |
6.9676872e-05 |
| 5,081 |
InfiniFilter: Expanding Filters to Infinity and Beyond |
2023 |
SIGMOD |
6.2854372e-05 |
| 6,704 |
Distance-Sensitive Hashing |
2018 |
PODS |
5.7051402e-05 |
| 7,940 |
Aleph Filter: To Infinity in Constant Time |
2024 |
VLDB |
5.4219572e-05 |
| 9,495 |
Set Similarity Search for Skewed Data |
2018 |
PODS |
5.1708619e-05 |
| 9,721 |
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation |
2025 |
PODS |
5.1349531e-05 |
| 10,507 |
Sublime: Sublinear Error & Space for Unbounded Skewed Streams |
2026 |
SIGMOD |
4.9793485e-05 |
| 12,054 |
On the I/O Complexity of the k-Nearest Neighbors Problem |
2020 |
PODS |
4.9793485e-05 |
| 12,780 |
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes |
2009 |
PODS |
4.9793485e-05 |
| 14,015 |
Cache-Oblivious Hashing |
2010 |
PODS |
- |