2026 Rasmus Pagh: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	42	8171	7940	37	35	162	13285

Rasmus Pagh publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Rasmus Pagh sits on this spectrum.

32 publications 991+

This scientist: 162 publications — 32nd percentile

32% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Rasmus Pagh D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Rasmus Pagh sits on this spectrum.

30 D-Index 131+

This scientist: 42 D-Index — 43rd percentile

43% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Overview

Rasmus Pagh is affiliated with the University of Copenhagen in Denmark and has a research profile rooted primarily in computer science with an emphasis on artificial intelligence and related subfields. Their work spans various areas including privacy-preserving technologies, cryptography, data security, and advanced methods in image and video retrieval.

The scientist has contributed extensively to the field of computer science, particularly with publications focusing on privacy and security, algorithms, and data compression. Their publication record includes numerous papers addressing these topics followed by research in internet traffic analysis, secure electronic voting, and machine learning algorithms.

Key topics covered in Rasmus Pagh's work include:

Privacy-Preserving Technologies in Data
Cryptography and Data Security
Advanced Image and Video Retrieval Techniques
Algorithms and Data Compression
Internet Traffic Analysis and Secure E-voting
Machine Learning and Algorithms
Complexity and Algorithms in Graphs

Rasmus Pagh has coauthored papers frequently with several researchers, including Martin Aumüller, Badih Ghazi, Pasin Manurangsi, Ravi Kumar, and Ameya Velingker.

Their recent papers demonstrate a wide scope, with titles such as:

"Advances and Open Problems in Federated Learning" (2020, Foundations and Trends® in Machine Learning)
"HyperLogLogLog" (2022, Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining)
"InfiniFilter: Expanding Filters to Infinity and Beyond" (2023, Proceedings of the ACM on Management of Data)
"Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overhead" (2021, arXiv (Cornell University))
"Fair near neighbor search via sampling" (2021, ACM SIGMOD Record)

The scientist regularly publishes in several respected venues, including arXiv (Cornell University), Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Proceedings of the ACM on Management of Data, ACM SIGMOD Record, and Lecture Notes in Computer Science.

Rasmus Pagh has also contributed to academic literature beyond articles by authoring a book titled Similarity Search and Applications, published by Springer Science+Business Media in 2020.

Best Publications

Advances and Open Problems in Federated Learning

Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet

4595
Citations
Cuckoo Hashing

Rasmus Pagh;Flemming Friche Rodler

2081
Citations
Advances and open problems in federated learning

Peter Kairouz;H. Brendan McMahan;Brendan Avent;Aurélien Bellet

1189
Citations
Fast and scalable polynomial kernels via explicit feature maps

Ninh Pham;Rasmus Pagh

373
Citations
Space Efficient Hash Tables With Worst Case Constant Access Time

Dimitris Fotakis;Rasmus Pagh;Peter Sanders;Paul G. Spirakis

252
Citations
Low Redundancy in Static Dictionaries with Constant Query Time

Rasmus Pagh

231
Citations
An optimal Bloom filter replacement

Anna Pagh;Rasmus Pagh;S. Srinivasa Rao

222
Citations
Colorful triangle counting and a MapReduce implementation

Rasmus Pagh;Charalampos E. Tsourakakis

191
Citations
Compressed matrix multiplication

Rasmus Pagh

166
Citations
Tight thresholds for cuckoo hashing via XORSAT

Martin Dietzfelbinger;Andreas Goerdt;Michael Mitzenmacher;Andrea Montanari

164
Citations
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data

Ninh Pham;Rasmus Pagh

159
Citations
Simple and space-efficient minimal perfect hash functions

Fabiano C. Botelho;Rasmus Pagh;Nivio Ziviani

156
Citations
Deterministic Dictionaries

Torben Hagerup;Peter Bro Miltersen;Rasmus Pagh

134
Citations
Uniform Hashing in Constant Time and Optimal Space

Anna Pagh;Rasmus Pagh

132
Citations
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses

Djamal Belazzougui;Paolo Boldi;Rasmus Pagh;Sebastiano Vigna

121
Citations
Space Efficient Hash Tables with Worst Case Constant Access Time

Dimitris Fotakis;Rasmus Pagh;Peter Sanders;Paul G. Spirakis

111
Citations
Faster join-projects and sparse matrix multiplications

Rasmus Resen Amossen;Rasmus Pagh

100
Citations
Uniform hashing in constant time and linear space

Anna Ostlin;Rasmus Pagh

98
Citations
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

Martin Dietzfelbinger;Rasmus Pagh

94
Citations
MapReduce Triangle Enumeration With Guarantees

Ha-Myung Park;Francesco Silvestri;U. Kang;Rasmus Pagh

89
Citations
Scalable and Differentially Private Distributed Aggregation in the Shuffled Model.

Badih Ghazi;Rasmus Pagh;Ameya Velingker

87
Citations

Frequent Co-Authors

Mikkel Thorup University of Copenhagen

Michael Mitzenmacher Harvard University

David P. Woodruff Carnegie Mellon University

Sebastiano Vigna University of Milan

Paolo Boldi University of Milan

Ravi Kumar Google (United States)

Nivio Ziviani Universidade Federal de Minas Gerais

Yoshihiro Yamanishi Nagoya University

Peter Sanders Karlsruhe Institute of Technology

Marco Gruteser Rutgers, The State University of New Jersey

External Links

Personal website of Rasmus Pagh Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens the door to a wide range of advanced degrees and career opportunities—many of which can be pursued entirely online. For those aiming to move into upper management or tech leadership, exploring executive mba programs online can provide the business acumen needed to climb the corporate ladder.

If you’re interested in information management and digital resources, consider an mlis degree (Master of Library and Information Science). This qualification can complement a Computer Science background, especially if your interests align with data curation or knowledge organization.

Prospective students looking for flexibility and cost savings can find a variety of affordable masters degrees in tech-related fields that support both skill development and career advancement.

For professionals striving to become leaders in technology organizations, an doctorate in organizational leadership online offers research-driven expertise and executive-level strategic skills.