- Algorithms
- Data Structures
- Hash Functions
- +۳ مورد دیگر
Mikkel Thorup is a Professor at the Department of Computer Science, University of Copenhagen, and a VILLUM Investigator heading the Basic Algorithms Research Copenhagen (BARC) Center supported by a €5.3 million grant from the VILLUM Foundation. Born in 1965, he holds a D.Phil. from Oxford University (1993). Prior roles include positions at the University of Copenhagen (1993–1998) and AT&T Labs-Research (1998–2013). His research focuses on algorithms, data structures, and hashing, with a particular emphasis on unifying theoretical and practical aspects. Awards include the ACM Fellowship, Villum Kann Rasmussen Award, and Fulkerson Prize. Education: D.Phil. in Computer Science, Oxford University (1993). Earlier positions: University of Copenhagen (1993–1998), AT&T Labs-Research (1998–2013). Research interests encompass algorithm design, data structure optimization, and hashing techniques. His work bridges theory and practice, addressing problems like graph clustering, optimization, and efficient sampling. He is known for contributions to correlation clustering, hash function analysis, and dynamic graph algorithms. Awards include the 2011 MAA Robbins Award, 2015 Villum Kann Rasmussen Award (Denmark’s top research prize), and 2021 AMS-MOS Fulkerson Prize. His Erdős number is 2, and he boasts an H-index above 60 with over 200 publications in top venues like STOC, FOCS, and SODA. Advising and grants: Leads BARC since 2017, funded by VILLUM Foundation. His research has influenced both academia and industry, particularly in telecommunications and algorithmic efficiency. Collaborates internationally, with a focus on foundational algorithmic challenges. Labs/Teams: Founder and head of BARC, fostering research in algorithms and their applications. Engages in interdisciplinary work combining theory with practical implementations.











