Mikkel Thorup: podcast appearances and interviews

Mikkel Thorup, born in 1965, is a Danish computer scientist specializing in algorithms and data structures. He completed his undergraduate studies at the Technical University of Denmark and earned his doctorate from Oxford University in 1993. His academic career includes positions at the University of Copenhagen from 1993 to 1998 and at AT T Labs Research in New Jersey from 1998 to 2013. Since 2013, Thorup has been a professor at the University of Copenhagen and leads the Center for Efficient Algorithms and Data Structures. His research achievements include developing a linear-time algorithm for the single-source shortest paths problem in undirected graphs. In collaboration with Mihai Pătraşcu, he demonstrated that simple tabulation hashing schemes can achieve performance comparable to higher independence hash families, with faster implementations. Thorup has served as an editor for various academic journals, including the Journal of the ACM, SIAM Journal on Computing, ACM Transactions on Algorithms, and the Theory of Computing. He has been recognized as a Fellow of the Association for Computing Machinery since 2005 and has been a member of the Royal Danish Academy of Sciences and Letters since 2006. His contributions to algorithms earned him the AT T Fellows Honor in 2010, and he was a co-winner of the 2011 David P. Robbins Prize for solving a classic problem in discrete mathematics. In 2021, Thorup also shared the Fulkerson Prize for his work on fast deterministic algorithms for edge connectivity, in collaboration with Ken-Ichi Kawarabayashi.