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.10117722
- Overall Rank
- 684 | 96.85%
- 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 all 14 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 2,229 |
The Input/Output Complexity of Triangle Enumeration |
2014 |
PODS |
10 |
8.7890942e-05 |
| 3,662 |
Scalable Computation of Acyclic Joins (Extended Abstract) |
2006 |
PODS |
5 |
7.1009211e-05 |
| 3,699 |
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions |
2020 |
PODS |
7 |
7.0668763e-05 |
| 3,774 |
On the Complexity of Inner Product Similarity Join |
2016 |
PODS |
8 |
7.0102162e-05 |
| 3,871 |
Is Min-Wise Hashing Optimal for Summarizing Set Intersection? |
2014 |
PODS |
7 |
6.9414117e-05 |
| 5,082 |
InfiniFilter: Expanding Filters to Infinity and Beyond |
2023 |
SIGMOD |
14 |
6.2679091e-05 |
| 6,717 |
Distance-Sensitive Hashing |
2018 |
PODS |
3 |
5.6843145e-05 |
| 7,959 |
Aleph Filter: To Infinity in Constant Time |
2024 |
VLDB |
8 |
5.4014706e-05 |
| 9,535 |
Set Similarity Search for Skewed Data |
2018 |
PODS |
1 |
5.151324e-05 |
| 9,757 |
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation |
2025 |
PODS |
1 |
5.115551e-05 |
| 10,584 |
Sublime: Sublinear Error & Space for Unbounded Skewed Streams |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 12,104 |
On the I/O Complexity of the k-Nearest Neighbors Problem |
2020 |
PODS |
0 |
4.9605343e-05 |
| 12,829 |
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes |
2009 |
PODS |
0 |
4.9605343e-05 |
| 14,060 |
Cache-Oblivious Hashing |
2010 |
PODS |
0 |
- |