2026 Mikkel Thorup: 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	69	1967	1905	7	7	251	20341

Mikkel Thorup 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 Mikkel Thorup sits on this spectrum.

32 publications 991+

This scientist: 251 publications — 63rd percentile

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

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

Mikkel Thorup 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 Mikkel Thorup sits on this spectrum.

30 D-Index 131+

This scientist: 69 D-Index — 87th percentile

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

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

Research.com Recognitions

2026 - Research.com Computer Science in Denmark Leader Award
2025 - Research.com Computer Science in Denmark Leader Award
2023 - Research.com Computer Science in Denmark Leader Award
2022 - Research.com Computer Science in Denmark Leader Award
2005 - ACM Fellow For contributions to algorithms and data structures.

Overview

Mikkel Thorup is a researcher affiliated with the University of Copenhagen in Denmark. Their work primarily focuses on computer science, with a significant body of publications in the field. Thorup's research spans various subfields, including artificial intelligence, computational theory and mathematics, computer networks and communications, computer vision and pattern recognition, and signal processing.

The scientist has contributed extensively to topics such as complexity and algorithms in graphs, algorithms and data compression, optimization and search problems, data management and algorithms, advanced image and video retrieval techniques, interconnection networks and systems, and chaos-based image/signal encryption.

Thorup has published papers in several well-regarded venues. These include:

arXiv (Cornell University), with 22 publications
Leibniz-Zentrum für Informatik (Schloss Dagstuhl), with 5 publications
TheoretiCS, with 1 publication
Lecture Notes in Computer Science, with 1 publication
Discrete & Computational Geometry, with 1 publication

Some recent papers authored or coauthored by Thorup are:

Improved Utility Analysis of Private CountSketch, 2022, arXiv (Cornell University)
Fully Dynamic Connectivity in O(log n(log log n)²) Amortized Expected Time, 2023, TheoretiCS
Confirmation Sampling for Exact Nearest Neighbor Search, 2020, Lecture Notes in Computer Science
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing, 2023, arXiv (Cornell University)
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing, 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Thorup frequently collaborates with a group of coauthors including Anders Aamand, Jakob Bæk Tejs Houen, Peter Seeberg, Evangelos Kipouridis, and Jakob Bæk Tejs Knudsen.

Thorup has also published books, including titles with Aarhus University Press and Johns Hopkins University. These books are "Demokratiets krise og de nye autokratier" (2020) and "Statens idéhistorie: Magt, vold og politik" (2023).

In terms of recognition, Thorup was awarded the ACM Fellow distinction in 2005 for contributions to algorithms and data structures.

Best Publications

Internet traffic engineering by optimizing OSPF weights

B. Fortz;M. Thorup

1712
Citations
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Jacob Holm;Kristian de Lichtenberg;Mikkel Thorup

1281
Citations
Approximate distance oracles

Mikkel Thorup;Uri Zwick

1171
Citations
Optimizing OSPF/IS-IS weights in a changing world

B. Fortz;M. Thorup

934
Citations
Traffic engineering with traditional IP routing protocols

B. Fortz;J. Rexford;M. Thorup

699
Citations
Compact routing schemes

Mikkel Thorup;Uri Zwick

682
Citations
Estimating flow distributions from sampled flow statistics

Nick Duffield;Carsten Lund;Mikkel Thorup

641
Citations
Undirected single-source shortest paths with positive integer weights in linear time

Mikkel Thorup

587
Citations
String matching in Lempel-Ziv compressed strings

Martin Farach;Mikkel Thorup

442
Citations
Compact oracles for reachability and approximate distances in planar digraphs

Mikkel Thorup

439
Citations
Increasing Internet Capacity Using Local Search

Bernard Fortz;Mikkel Thorup

361
Citations
Properties and prediction of flow statistics from sampled packet streams

Nick Duffield;Carsten Lund;Mikkel Thorup

345
Citations
Near-optimal fully-dynamic graph connectivity

Mikkel Thorup

273
Citations
Charging from sampled network usage

Nick Duffield;Carsten Lund;Mikkel Thorup

266
Citations
Tabulation based 4-universal hashing with applications to second moment estimation

Mikkel Thorup;Yin Zhang

252
Citations
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)

Richa Agarwala;Vineet Bafna;Martin Farach;Mike Paterson

251
Citations
Spanners and emulators with sublinear distance errors

Mikkel Thorup;Uri Zwick

226
Citations
Time-space trade-offs for predecessor search

Mihai Pătraşcu;Mikkel Thorup

223
Citations
On the approximability of numerical taxonomy (fitting distances by tree metrics)

Richa Agarwala;Vineet Bafna;Martin Farach;Babu Narayanan

223
Citations
All structured programs have small tree width and good register allocation

Mikkel Thorup

217
Citations

Frequent Co-Authors

Nick Duffield Texas A&M University

Uri Zwick Tel Aviv University

Carsten Lund AT&T (United States)

Haim Kaplan Tel Aviv University

Ken-ichi Kawarabayashi National Institute of Informatics

Martin Farach New York University

Edith Cohen Tel Aviv University

Rasmus Pagh University of Copenhagen

Yin Zhang The University of Texas at Austin

Monika Henzinger Institute of Science and Technology Austria

External Links

Wikipedia of Mikkel Thorup Personal website of Mikkel Thorup Google Scholar page

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

Related Online Degrees & Career Pathways

Considering a degree in Computer Science opens many online education and career options. For those looking to enhance their business acumen alongside tech skills, affordable online MBA programs are an excellent way to build management expertise while staying within budget.

If you’re seeking to quickly advance your qualifications, some of the 1 year masters degree programs online offer a fast track to higher-level roles in tech and related fields. These accelerated options can help you boost your employability without a long time away from work.

Not sure which credential offers the biggest payoff? Explore the best online degrees for career growth and salary potential. Many of these programs blend flexibility, affordability, and strong job opportunities.

Finally, for those passionate about innovative tech, the best online masters in artificial intelligence can open doors to cutting-edge careers in machine learning, data science, and AI-driven industries.