Age, Biography and Wiki
Mikkel Thorup was born on 1965 in Denmark, is a Danish computer scientist. Discover Mikkel Thorup's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 59 years old?
Popular As |
N/A |
Occupation |
N/A |
Age |
59 years old |
Zodiac Sign |
N/A |
Born |
1965 |
Birthday |
|
Birthplace |
Denmark |
Nationality |
Denmark
|
We recommend you to check the complete list of Famous People born on .
He is a member of famous computer with the age 59 years old group.
Mikkel Thorup Height, Weight & Measurements
At 59 years old, Mikkel Thorup height not available right now. We will update Mikkel Thorup's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.
Physical Status |
Height |
Not Available |
Weight |
Not Available |
Body Measurements |
Not Available |
Eye Color |
Not Available |
Hair Color |
Not Available |
Dating & Relationship status
He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.
Family |
Parents |
Not Available |
Wife |
Not Available |
Sibling |
Not Available |
Children |
Not Available |
Mikkel Thorup Net Worth
His net worth has been growing significantly in 2023-2024. So, how much is Mikkel Thorup worth at the age of 59 years old? Mikkel Thorup’s income source is mostly from being a successful computer. He is from Denmark. We have estimated Mikkel Thorup's net worth, money, salary, income, and assets.
Net Worth in 2024 |
$1 Million - $5 Million |
Salary in 2024 |
Under Review |
Net Worth in 2023 |
Pending |
Salary in 2023 |
Under Review |
House |
Not Available |
Cars |
Not Available |
Source of Income |
computer |
Mikkel Thorup Social Network
Timeline
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.
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.
One of his best-known results is a linear-time algorithm for the single-source shortest paths problem in undirected graphs (Thorup, 1999).
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.
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.
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.”
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.
“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.”
In 2021 he was co-winner of the Fulkerson Prize for his work with Ken-ichi Kawarabayashi on fast deterministic algorithms for edge connectivity.
Since 2013 he has been at the University of Copenhagen as a Professor and Head of Center for Efficient Algorithms and Data Structures (EADS).
Thorup's main work is in algorithms and data structures.