M
Mikkel Thorup
Researcher at University of Copenhagen
Publications - 306
Citations - 17294
Mikkel Thorup is an academic researcher from University of Copenhagen. The author has contributed to research in topics: Time complexity & Hash function. The author has an hindex of 63, co-authored 297 publications receiving 16344 citations. Previous affiliations of Mikkel Thorup include Max Planck Society & University of Copenhagen Faculty of Science.
Papers
More filters
Proceedings ArticleDOI
Internet traffic engineering by optimizing OSPF weights
Bernard Fortz,Mikkel Thorup +1 more
TL;DR: Surprisingly it turned out that for the proposed AT&T WorldNet backbone, weight settings that performed within a few percent from that of the optimal general routing where the flow for each demand is optimally distributed over all paths between source and destination.
Journal ArticleDOI
Optimizing OSPF/IS-IS weights in a changing world
Bernard Fortz,Mikkel Thorup +1 more
TL;DR: A system of techniques is presented for optimizing open shortest path first (OSPF) or intermediate system-intermediate system (IS-IS) weights for intradomain routing in a changing world, the goal being to avoid overloaded links.
Journal ArticleDOI
Approximate distance oracles
Mikkel Thorup,Uri Zwick +1 more
TL;DR: The most impressive feature of the data structure is its constant query time, hence the name "oracle", and it provides faster constructions of sparse spanners of weighted graphs, and improved tree covers and distance labelings of weighted or unweighted graphs.
Proceedings ArticleDOI
Approximate distance oracles
Mikkel Thorup,Uri Zwick +1 more
TL;DR: The most impressive feature of the data structure is its constant query time, hence the name ``oracle', which provides faster constructions of sparse spanners of weighted graphs, and improved tree covers and distance labelings of weighted or unweighted graphs.
Proceedings ArticleDOI
Compact routing schemes
Mikkel Thorup,Uri Zwick +1 more
TL;DR: Several compact routing schemes for general weighted undirected networks are described, which achieve a near-optimal tradeoff between the size of the routing tables used and the resulting stretch.