Oxford University, Technical University of Denmark
Scientific career
Fields
Computer Science
Institutions
University of Copenhagen
Thesis
Topics in computation(1994)
Doctoral advisor
William F. "Bill" McColl Colin McDiarmid
Mikkel Thorup (born 1965) is a Danish computer scientist working at University of Copenhagen.
He completed his undergraduate education at Technical University of Denmark and his doctoral studies at Oxford University in 1993.[1] From 1993 to 1998, he was at University of Copenhagen and from 1998 to 2013 he was at AT&T Labs-Research in New Jersey. Since 2013 he has been at the University of Copenhagen as a Professor and Head of Center for Efficient Algorithms and Data Structures (EADS).[2]
Thorup's main work is in algorithms and data structures. One of his best-known results is a linear-time algorithm for the single-source shortest paths problem in undirected graphs (Thorup, 1999).[3]
With Mihai Pătraşcu he has shown that simple tabulation hashing schemes achieve the same or similar performance criteria as hash families that have higher independence in worst case, while permitting speedier implementations.[4][5]
Thorup has been editor of the area algorithm and data structures for Journal of the ACM, and has also served on the editorial boards of SIAM Journal on Computing, ACM Transactions on Algorithms, and the Theory of Computing.
He has been a Fellow of the Association for Computing Machinery since 2005 for his contributions to algorithms and data structures.[6] He belongs to the Royal Danish Academy of Sciences and Letters since 2006. In 2010 he was bestowed the AT&T Fellows Honor for “outstanding innovation in algorithms, including advanced hashing and sampling techniques applied to AT&T's Internet traffic analysis and speech services.”[7]
In 2011 he was co-winner of the David P. Robbins Prize from the Mathematical Association of America for solving, to within a constant factor, the classic problem of stacking blocks on a table to achieve the maximum possible overhang, i.e., reaching out the furthest horizontal distance from the edge of the table.[8] “The papers describe an impressive result in discrete mathematics; the problem is easily understood and the arguments, despite their depth, are easily accessible to any motivated undergraduate.” [3]
In 2021 he was co-winner of the Fulkerson Prize for his work with Ken-Ichi Kawarabayashi on fast deterministic algorithms for edge connectivity.
[9]
^Mathematics genealogy project
^Thorup’s personal home page
^ abRobbins Prize Citation
^Pătraşcu & Thorup 2011.
^Regan, Tabulation hashing and independence, Gödel’s Lost Letter, April 14, 2012, Fortnow, Complexity year in review, December 29, 2011.
^ACM Fellows web site Archived 2012-05-27 at the Wayback Machine
MikkelThorup (born 1965) is a Danish computer scientist working at University of Copenhagen. He completed his undergraduate education at Technical University...
Jess Thorup (born 21 February 1970) is a Danish professional football manager and former player. He is currently head coach of Bundesliga club FC Augsburg...
planar digraphs, a much faster method is available, as described by MikkelThorup in 2004. This method can answer reachability queries on a planar graph...
connectivity Stephen Alstrup, Jacob Holm, Kristian De Lichtenberg, and MikkelThorup, Maintaining information in fully dynamic trees with top trees, ACM...
model, integer sorting can be done fairly efficiently. Yijie Han and MikkelThorup created a randomized algorithm to sort integers in expected time of...
hashing." ACM Transactions on Algorithms (2009). Pǎtraşcu, Mihai, and MikkelThorup. "The power of simple tabulation hashing." Journal of the ACM (JACM)...
Prize for the paper Maximum Overhang, by Mike Paterson, Yuval Peres, MikkelThorup, Peter Winkler, and Uri Zwick. Plenary talk by Yuval Peres at the 2011...
research sections: The Algorithms and Complexity Section, headed by MikkelThorup, who conduct basic algorithms research, as well as research on data...
complexity. For the static predecessor problem, Mihai Pătrașcu and MikkelThorup showed the following lower bound for the optimal search time, in the...
Islamic core scriptures]". In Mehdi Mozaffari; Hans-Jørgen Schanz; MikkelThorup (eds.). Totalitarisme: venskab og fjendskab (in Danish). Århus Universitetsforlag...
Complexity of Counting CSP with Complex Weights Ken-Ichi Kawarabayashi and MikkelThorup for Deterministic Edge Connectivity in Near-Linear Time Source: Mathematical...
map graph can be represented as a half-square in this way. In 1998, MikkelThorup claimed that map graphs can be recognized in polynomial time. However...
referenced as "Tsakalidis' Algorithm" in the optimal results of prof. MikkelThorup. His extensive work on algorithms, data structures, computational geometry...
Mądry (Workshop Chair), James R. Lee (Workshop Chair) Berkeley " 2018 MikkelThorup (PC Chair), Adi Rosén (Local Chair), Sophie Laplante (Local co-Chair)...
Lakshman Brad A. Myers David M. Nicol Krishna Palem Thomas W. Reps Lui Sha MikkelThorup Eli Upfal Umesh Vazirani Vijay Vazirani Roy Want Gerhard Weikum Uri...
co-founded the Basic Algorithms Research Center, BARC, in Copenhagen with MikkelThorup, Thore Husfeldt and Stephen Alstrup. Soon thereafter he took a sabbatical...
MR 1717389, S2CID 2125652. Andersson, Arne; Miltersen, Peter Bro; Thorup, Mikkel (1999), "Fusion trees can be implemented with AC0 instructions only"...
2009 – 15 April 2011) Glen Riddersholm (16 April 2011– 25 June 2015) Jess Thorup (12 July 2015 – 10 October 2018) Kenneth Andersen (10 October 2018 – 19...
Raphael Phan, Luca Henzen. "The Hash Function BLAKE". 2014. p. 10. Thorup, Mikkel (2015). "High Speed Hashing for Integers and Strings". arXiv:1504.06804...
Global Information