Mikkel Thorup

from Wikipedia, the free encyclopedia

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

Thorup studied at the Technical University of Denmark in Lyngby from 1986 to 1990 and received his doctorate in 1994 from Colin McDiarmid at Oxford University (where he was in the CAR Hoare computer science laboratory ) and then until 1998 at the University of Copenhagen where he is a professor. Since 1998 he has been on leave and has been a technical consultant and later a senior (permanent) scientist at ATT Research Laboratories in New Jersey.

In 1998 he was visiting scholar at the Massachusetts Institute of Technology , 1992–1993 at DIMACS at Rutgers University (with Laszlo Lovasz and Paul Seymour ), 1997 visiting professor at the Max Planck Institute for Computer Science

He is concerned with algorithm theory and data structures and has been editor in this sector for the Journal of the ACM since 2004 . He is also co-editor of ACM Transactions on Algorithms (since 2004), the Open Access Journal Theory of Computing and the SIAM Journal on Computing (since 2004). From 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 in voice traffic. He is co-developer of a process (Smart Sampling Technologies) that forms the basis of ATT's Scalable Traffic Analysis Service for the Internet.

With Mihai Pătrașcu (1982–2012), he showed that even simple hash tables perform surprisingly well.

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

In 2011 he was one of the recipients of the David P. Robbins Prize for a paper that addressed the problem of the number of stacked building blocks with overhangs.

Web links

Individual evidence

  1. ↑ Patrascu, Thorup The power of simple tabulation hashing , Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC '11), 2011, pp. 1-10, online
  2. ↑ Thorup Undirected Single Source Shortest Paths with Positive Integer Weights in Linear Time , Journal of the ACM, Volume 46, 1999, pp. 362-394 and Proc. 38. IEEE Symp. Found. Computing (FOCS) 1997
  3. ↑ Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick Overhang , American Mathematical Monthly, Volume 116, p. 763, January 2009
personal data
SURNAME Thorup, Mikkel
BRIEF DESCRIPTION Danish computer scientist
DATE OF BIRTH February 13, 1965
PLACE OF BIRTH Copenhagen