World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Denmark
2026

D-Index & Metrics

Computer Science

D-Index
69
Citations
20341
World Ranking
1967
National Ranking
7

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)2) 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

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

    Jacob Holm;Kristian de Lichtenberg;Mikkel Thorup

  • Approximate distance oracles

    Mikkel Thorup;Uri Zwick

  • Optimizing OSPF/IS-IS weights in a changing world

    B. Fortz;M. Thorup

  • Traffic engineering with traditional IP routing protocols

    B. Fortz;J. Rexford;M. Thorup

  • Compact routing schemes

    Mikkel Thorup;Uri Zwick

  • Estimating flow distributions from sampled flow statistics

    Nick Duffield;Carsten Lund;Mikkel Thorup

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

    Mikkel Thorup

  • String matching in Lempel-Ziv compressed strings

    Martin Farach;Mikkel Thorup

  • Compact oracles for reachability and approximate distances in planar digraphs

    Mikkel Thorup

  • Increasing Internet Capacity Using Local Search

    Bernard Fortz;Mikkel Thorup

  • Properties and prediction of flow statistics from sampled packet streams

    Nick Duffield;Carsten Lund;Mikkel Thorup

  • Near-optimal fully-dynamic graph connectivity

    Mikkel Thorup

  • Charging from sampled network usage

    Nick Duffield;Carsten Lund;Mikkel Thorup

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

    Mikkel Thorup;Yin Zhang

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

    Richa Agarwala;Vineet Bafna;Martin Farach;Mike Paterson

  • Spanners and emulators with sublinear distance errors

    Mikkel Thorup;Uri Zwick

  • Time-space trade-offs for predecessor search

    Mihai Pătraşcu;Mikkel Thorup

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

    Richa Agarwala;Vineet Bafna;Martin Farach;Babu Narayanan

  • All structured programs have small tree width and good register allocation

    Mikkel Thorup

Frequent Co-Authors

Nick Duffield
Nick Duffield Texas A&M University
Uri Zwick
Uri Zwick Tel Aviv University
Carsten Lund
Carsten Lund AT&T (United States)
Haim Kaplan
Haim Kaplan Tel Aviv University
Ken-ichi Kawarabayashi
Ken-ichi Kawarabayashi National Institute of Informatics
Martin Farach
Martin Farach New York University
Edith Cohen
Edith Cohen Tel Aviv University
Rasmus Pagh
Rasmus Pagh University of Copenhagen
Yin Zhang
Yin Zhang The University of Texas at Austin
Monika Henzinger
Monika Henzinger Institute of Science and Technology Austria

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Mikkel Thorup

Trending Scientists

Recently Published Articles