Rasmus Pagh
#63,063
Most Influential Person Now
Danish computer scientist
Rasmus Pagh's AcademicInfluence.com Rankings
Rasmus Paghcomputer-science Degrees
Computer Science
#2408
World Rank
#2514
Historical Rank
Data Mining
#255
World Rank
#256
Historical Rank
Database
#7572
World Rank
#7857
Historical Rank
Download Badge
Computer Science
Rasmus Pagh's Degrees
- PhD Computer Science University of Copenhagen
- Masters Mathematics University of Copenhagen
Similar Degrees You Can Earn
Why Is Rasmus Pagh Influential?
(Suggest an Edit or Addition)According to Wikipedia, 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's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Advances and Open Problems in Federated Learning (2019) (2826)
- Cuckoo Hashing (2001) (1191)
- Fast and scalable polynomial kernels via explicit feature maps (2013) (303)
- Space Efficient Hash Tables with Worst Case Constant Access Time (2003) (204)
- An optimal Bloom filter replacement (2005) (175)
- Colorful triangle counting and a MapReduce implementation (2011) (162)
- Tight Thresholds for Cuckoo Hashing via XORSAT (2009) (133)
- Simple and Space-Efficient Minimal Perfect Hash Functions (2007) (121)
- A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data (2012) (115)
- Monotone minimal perfect hashing: searching a sorted table with O(1) accesses (2009) (114)
- Deterministic Dictionaries (2001) (105)
- Compressed matrix multiplication (2011) (89)
- Succinct Data Structures for Retrieval and Approximate Membership (2008) (79)
- Uniform Hashing in Constant Time and Optimal Space (2008) (76)
- Scalable and Differentially Private Distributed Aggregation in the Shuffled Model (2019) (74)
- Triangle Counting in Dynamic Graph Streams (2014) (73)
- Faster join-projects and sparse matrix multiplications (2009) (71)
- Uniform hashing in constant time and linear space (2003) (70)
- MapReduce Triangle Enumeration With Guarantees (2014) (70)
- Linear probing with constant independence (2006) (67)
- Listing Triangles (2014) (64)
- Efficient estimation for high similarities using odd sketches (2014) (62)
- The input/output complexity of triangle enumeration (2013) (62)
- On dynamic range reporting in one dimension (2005) (59)
- Oblivious Sketching of High-Degree Polynomial Kernels (2019) (56)
- Fast Prefix Search in Little Space, with Applications (2010) (53)
- Practical perfect hashing in nearly optimal space (2013) (52)
- Theory and practice of monotone minimal perfect hashing (2011) (52)
- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time (1999) (51)
- On the cell probe complexity of membership and perfect hashing (2001) (51)
- On the Power of Multiple Anonymous Messages (2019) (50)
- Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions (1999) (49)
- Locality-sensitive Hashing without False Negatives (2015) (48)
- On the Complexity of Inner Product Similarity Join (2015) (46)
- Low Redundancy in Static Dictionaries with Constant Query Time (2002) (45)
- Fast Evaluation of Union-Intersection Expressions (2007) (43)
- Set similarity search beyond MinHash (2016) (42)
- The chaperone and potential mannan‐binding lectin (MBL) co‐receptor calreticulin interacts with MBL through the binding site for MBL‐associated serine proteases (2008) (40)
- Parameter-free Locality Sensitive Hashing for Spherical Range Reporting (2016) (39)
- Pure Differentially Private Summation from Anonymous Messages (2020) (37)
- Private Aggregation from Fewer Anonymous Messages (2019) (36)
- Is min-wise hashing optimal for summarizing set intersection? (2014) (35)
- Compressed matrix multiplication (2013) (31)
- Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead (2020) (31)
- I/O-Efficient Similarity Join (2015) (29)
- A New Data Layout for Set Intersection on GPUs (2011) (29)
- On the streaming complexity of computing local clustering coefficients (2013) (27)
- Low redundancy in dictionaries with O(1) worst case lookup time (1998) (27)
- I/O-efficient data structures for colored range and prefix reporting (2011) (27)
- Better Size Estimation for Sparse Matrix Products (2010) (27)
- Lossy Dictionaries (2001) (26)
- Simple multi-party set reconciliation (2013) (24)
- Approximate Furthest Neighbor in High Dimensions (2015) (23)
- Theory and Practise of Monotone Minimal Perfect Hashing (2009) (23)
- Scalable and Robust Set Similarity Join (2017) (23)
- Finding associations and computing similarity via biased pair sampling (2009) (22)
- Linear Probing with 5-wise Independence (2011) (19)
- Distance-Sensitive Hashing (2017) (19)
- How to Approximate a Set without Knowing Its Size in Advance (2013) (19)
- The Input/Output Complexity of Sparse Matrix Multiplication (2014) (18)
- From Independence to Expansion and Back Again (2015) (18)
- Scalability and Total Recall with Fast CoveringLSH (2016) (18)
- Approximate Range Emptiness in Constant Time and Optimal Space (2014) (18)
- Scalable computation of acyclic joins (2006) (17)
- Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message (2021) (17)
- Faster deterministic dictionaries (1999) (17)
- On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy (2021) (16)
- PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors (2019) (16)
- Composable Sketches for Functions of Frequencies: Beyond the Worst Case (2020) (16)
- A Trade-Off for Worst-Case Efficient Dictionaries (2000) (15)
- Optimality in External Memory Hashing (2007) (15)
- Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing (2001) (14)
- Simulating Uniform Hashing in Constant Time and Optimal Space (2002) (14)
- Cache-Oblivious Hashing (2010) (14)
- Distance Sensitive Bloom Filters Without False Negatives (2016) (13)
- A New Trade-Off for Deterministic Dictionaries (2000) (13)
- Efficient Differentially Private F0 Linear Sketching (2020) (12)
- Generating k-Independent Variables in Constant Time (2014) (12)
- Storing a Compressed Function with Constant Time Access (2009) (12)
- Basic External Memory Data Structures (2002) (11)
- Enumerating Trillion Subgraphs On Distributed Systems (2018) (11)
- Optimal time-space trade-offs for non-comparison-based sorting (2001) (11)
- Secondary indexing in one dimension: beyond b-trees and bitmap indexes (2008) (10)
- Approximate furthest neighbor with application to annulus query (2016) (10)
- Fair Near Neighbor Search: Independent Range Sampling in High Dimensions (2019) (10)
- External String Sorting: Faster and Cache-Oblivious (2006) (9)
- Hashing, randomness and dictionaries (2010) (8)
- Set Similarity Search for Skewed Data (2018) (7)
- On Adaptive Integer Sorting (2004) (7)
- Dispersing hash functions (2000) (7)
- Large-Scale Similarity Joins With Guarantees (Invited Talk) (2015) (7)
- One-Probe Search (2002) (7)
- Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All? (2021) (6)
- Efficiently Correcting Matrix Products (2014) (6)
- Thresholds for Extreme Orientability (2012) (6)
- On Finding Similar Items in a Stream of Transactions (2010) (6)
- Private Heavy Hitters and Range Queries in the Shuffled Model (2019) (5)
- Improved Utility Analysis of Private CountSketch (2022) (5)
- Confirmation Sampling for Exact Nearest Neighbor Search (2018) (5)
- Fair near neighbor search via sampling (2021) (5)
- Cuckoo Hashing for Undergraduates (2006) (5)
- Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access (2021) (4)
- Perfect Hashing for Data Management Applications (2007) (4)
- WOR and p's: Sketches for 𝓁p-Sampling Without Replacement (2020) (4)
- CountSketches, Feature Hashing and the Median of Three (2021) (4)
- High-dimensional Spherical Range Reporting by Output-Sensitive Multi-Probing LSH (2016) (4)
- On Finding Frequent Patterns in Event Sequences (2010) (4)
- Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons (2017) (3)
- Deterministic load balancing and dictionaries in the parallel disk model (2006) (3)
- Frequent Pairs in Data Streams: Exploiting Parallelism and Skew (2011) (3)
- DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search (2021) (3)
- Hardness of Bichromatic Closest Pair with Jaccard Similarity (2019) (3)
- On parallelizing matrix multiplication by the column-row method (2012) (2)
- CoveringLSH: Locality-Sensitive Hashing without False Negatives (2015) (2)
- Consistent Subset Sampling (2014) (2)
- HyperLogLogLog: Cardinality Estimation With One Log More (2022) (1)
- A Generic Global Constraint based on MDDs (2006) (1)
- I/O-Efficient Similarity Join (2017) (1)
- Space-Efficient Feature Maps for String Alignment Kernels (2018) (1)
- Representing Sparse Vectors with Differential Privacy, Low Error, Optimal Space, and Fast Access (2022) (1)
- `p-SAMPLING WITHOUT REPLACEMENT (2020) (1)
- Better Size Estimation for Sparse Matrix Products (2013) (1)
- Similarity Sketching (2019) (1)
- Practical Perfect Hashing Algorithm in Nearly Optimal Space (2013) (1)
- The space complexity of inner product filters (2019) (1)
- Theory and Applications of Hashing (Dagstuhl Seminar 17181) (2017) (1)
- Space-Efficient Feature Maps for String Alignment Kernels (2020) (1)
- Association Rule Mining using Maximum Entropy (2015) (1)
- Infinitely Divisible Noise in the Low Privacy Regime (2021) (1)
- A ug 2 01 6 Scalability and Total Recall with Fast CoveringLSH (2018) (1)
- Large-Scale Similarity Joins With Guarantees (2015) (1)
- WOR and $p$'s: Sketches for $\ell_p$-Sampling Without Replacement (2020) (0)
- Library software FN (2015) (0)
- 2-2012 Thresholds for Extreme Orientability (2015) (0)
- Efficient Construction of 2 K + Graphs (2014) (0)
- Cache-Oblivious Hashing (2013) (0)
- Guided tour of some results on hashing and dictionaries (2001) (0)
- Generic Global Constraints based on MDDs (2007) (0)
- Efficiently Correcting Matrix Products (arXiv 2016) (2016) (0)
- Technical Perspective (2022) (0)
- 2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award (2021) (0)
- Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018 (2018) (0)
- Daisy Bloom Filters (2022) (0)
- Simple Set Sketching (2022) (0)
- On the I/O Complexity of the k-Nearest Neighbors Problem (2020) (0)
- Tight Thresholds for Cuckoo Hashing via XORSAT ( Extended Abstract ) (2010) (0)
- Triangle Counting in Dynamic Graph Streams (2015) (0)
- Thresholds for Extreme Orientability (2013) (0)
- Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 – October 2, 2020, Proceedings (2020) (0)
- Report from Dagstuhl Seminar 17181 Theory and Applications of Hashing (2017) (0)
- 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (2018) (0)
- CoveringLSH (2018) (0)
- Exercises, Algorithm Design II, Fall 2012 (2012) (0)
- The proof of Theorem 2 will be based on a result by Rubinstein [ 9 ] : Assuming the Orthogonal Vectors Conjecture (2019) (0)
- Hardness and Approximation of High-Dimensional Search Problems (Invited Talk) (2017) (0)
- Scalable Alignment Kernels via Space-Efficient Feature Maps (2018) (0)
- Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy (2023) (0)
- Simple multi-party set reconciliation (2017) (0)
- Theory and applications of hashing : report from Dagstuhl Seminar 17181 (2017) (0)
- Sampling near neighbors in search for fairness (2022) (0)
- On Finding Frequent Patterns in Directed Acyclic Graphs (2010) (0)
- Efficiently Correcting Matrix Products (2016) (0)
- A computer-implemented method for carrying out a search without the use of signatures (2015) (0)
- A method and a device for automatic rinsing of filters, in particular for washing Cambridge filters in smoking machines (2011) (0)
- Query Tuning (2009) (0)
- Front Matter, Table of Contents, Preface, Program Committee, Subreviewers (2016) (0)
- Session details: Geometry (2009) (0)
- Query Compilation (2009) (0)
- Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming (2023) (0)
- Database Tuning, ITU, Spring 2009 (2008) (0)
- Session details: Graphs (2009) (0)
- Technical Perspective: Relative Error Streaming Quantiles (2022) (0)
- 2 . Basic External Memory Data Structures (2003) (0)
- Efficient Differentially Private Weighted $F_0$ Linear Sketching (2020) (0)
This paper list is powered by the following services:
Other Resources About Rasmus Pagh
What Schools Are Affiliated With Rasmus Pagh?
Rasmus Pagh is affiliated with the following schools:
