Mikkel Thorup

Mikkel Thorup ( born February 13, 1965 in Copenhagen ) is a Danish computer scientist.

Thorup studied in 1986, received his diploma in 1990 at the Technical University of Denmark in Lyngby and in 1994 received his doctorate at the University of Oxford in Colin McDiarmid (where he was in the computer science laboratory of CAR Hoare ) and was thereafter to 1998 at the University of Copenhagen where he is a professor. But since 1998, he is on leave and technical consultant and later a senior ( tenured ) Scientists at the ATT Research Laboratories in New Jersey.

In 1998 he was a visiting scientist at the Massachusetts Institute of Technology, 1992/93 at the DIMACS Rutgers University (with Laszlo Lovasz and Paul Seymour ), 1997 Visiting Professor at the Max Planck Institute for computer science

It deals with algorithms and data structures theory and since 2004 editor in this sector for the Journal of the ACM. He is also associate editor of the ACM Transactions on Algorithms (since 2004), of Open Access Journals Theory of Computing and the SIAM Journal on Computing ( since 2004). 1999 to 2004 he was co-editor of the Journal of Algorithms. He is a member of the Royal Danish Academy of Sciences ( 2006), Fellow of ATT (2010) and the Association for Computing Machinery ( 2005). In 2003 he received the ATT Research Excellence Award.

He dealt with hashing, and developed methods for data flow analysis on the Internet and voice traffic. He is co - developer of a method (Smart Sampling Technologies), which forms the basis of the Scalable Traffic Analysis Service from ATT for the Internet.

With Mihai Pătraşcu (1982-2012), he showed that even simple hash tables show surprisingly good performance.

In 1997 he gave to a linear in time algorithm for the Single Source Shortest Path ( SSSP ) problem.

In 2012 he was one of the recipients of the David P. Robbins Prize for a work that dealt with the problem of the number of stacked blocks with overhang.