Rasmus Pagh
- Artificial Intelligence top 1%
- Computer Networks and Communications top 1%
- Computer Vision and Pattern Recognition top 2%
- Hardware and Architecture top 2%
- Computational Theory and Mathematics top 1%
- Co-authors
- Flemming Friche RodlerNinh PhamAnna PaghCharalampos E. TsourakakisSrinivasa Rao SattiPeter SandersPaul G. SpirakisDimitris Fotakis
- Topics
- Algorithms and Data Compression (49 papers)Advanced Image and Video Retrieval Techniques (27 papers)Complexity and Algorithms in Graphs (20 papers)
- Journals
- SHILAP Revista de lepidopterologíaCommunications of the ACMSIAM Review
- Partner nations
- DenmarkUnited StatesItaly
In The Last Decade
Rasmus Pagh
81 papers receiving 2.1k citations
Hit Papers
Peers
Comparison fields: 5 of 92
- Artificial Intelligence 1.3k
- Computer Networks and Communications 1.2k
- Computer Vision and Pattern Recognition 515
- Hardware and Architecture 390
- Computational Theory and Mathematics 387
Countries citing papers authored by Rasmus Pagh
This map shows the geographic impact of Rasmus Pagh's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rasmus Pagh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rasmus Pagh more than expected).
Fields of papers citing papers by Rasmus Pagh
This network shows the impact of papers produced by Rasmus Pagh. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rasmus Pagh. The network helps show where Rasmus Pagh may publish in the future.
Co-authorship network of co-authors of Rasmus Pagh
This figure shows the co-authorship network connecting the top 25 collaborators of Rasmus Pagh. A scholar is included among the top collaborators of Rasmus Pagh based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rasmus Pagh. Rasmus Pagh is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 13 | |
| 3 | 3 | |
| 4 | 1 | |
| 5 | 2 | |
| 6 | 1 | |
| 7 | 5 | |
| 8 | 44 | |
| 9 | Practical Perfect Hashing Algorithm in Nearly Optimal Space | 0 |
| 10 | 6 | |
| 11 | 33 | |
| 12 | 94 | |
| 13 | 1 | |
| 14 | Lossy Dictionaries | 9 |
| 15 | Cuckoo Hashing | 130 |
| 16 | 6 | |
| 17 | 10 | |
| 18 | A trade-off for worst-case efficient dictionaries | 5 |
| 19 | 5 | |
| 20 | 16 |
About Rasmus Pagh
Rasmus Pagh is a scholar working on Computational Mathematics, Artificial Intelligence and Computer Vision and Pattern Recognition, having authored 88 papers that have together received 2.3k indexed citations. Recurring topics across this work include Algorithms and Data Compression (49 papers), Advanced Image and Video Retrieval Techniques (27 papers) and Complexity and Algorithms in Graphs (20 papers). The work is most often cited by research in Computational Mathematics (55 citations), Hardware and Architecture (390 citations) and Computer Networks and Communications (1.2k citations). Rasmus Pagh has collaborated with scholars based in Denmark, United States and Italy. Frequent co-authors include Flemming Friche Rodler, Ninh Pham, Anna Pagh, Charalampos E. Tsourakakis, Srinivasa Rao Satti, Peter Sanders, Paul G. Spirakis, Dimitris Fotakis, Torben Hagerup and Peter Bro Miltersen. Their work appears in journals such as SHILAP Revista de lepidopterología, Communications of the ACM and SIAM Review.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.