Mikkel Thorup
Professor
- 2002
A Memetic Algorithms for OSPF Routing
Buriol, L. S., Resende, M. G. C., Ribeiro, C. C. & Thorup, Mikkel, 2002, Proceedings of the 6th INFORMS Telecom. p. 187-188 2 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Efficient tree layout in a multilevel memory hierarchy
Alstrup, Stephen, Bender, M. A., Demaine, E. D., Farach-Colton, M., Rauhe, T. & Thorup, Mikkel, 2002, In: arXiv preprint cs/0211010.Research output: Contribution to journal › Journal article › Research
Equivalence between Priority Queues and Sorting
Thorup, Mikkel, 2002, Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). p. 125-134 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Integer Sorting in O(nlog log n) Expected Time and Linear Space
Han, Y. & Thorup, Mikkel, 2002, Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS). p. 135-144 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
On Distance Oracles and Routing in Graphs (Invited Talk)
Thorup, Mikkel, 2002, Proceedings of the 10th Annual European Symposium on Algorithms (ESA), LNCS 2461. p. 4 1 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Optimizing OSPF/IS-IS weights in a changing world
Fortz, B. & Thorup, Mikkel, 2002, In: IEEE Journal on Selected Areas in Communications (Special Issue on Recent Advances on Fundamentals of Network Management). 20, 4, p. 756-767 12 p.Research output: Contribution to journal › Journal article › Research › peer-review
Oracles for Distances Avoiding a Link-Failure
Demetrescu, C. & Thorup, Mikkel, 2002, Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 838-843 6 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Properties and Prediction of Flow Statistics from Sampled Packet Streams
Duffield, N., Lund, C. & Thorup, Mikkel, 2002, Proceedings of the 2nd ACM SIGCOMM Internet Measurement Workshop (IMW). p. 159-171 13 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations
Thorup, Mikkel, 2002, In: Journal of Algorithms. 42, 2, p. 205-230 26 p.Research output: Contribution to journal › Journal article › Research › peer-review
Roundtrip Spanners and Roundtrip Routing in Directed Graphs
Roditty, L., Thorup, Mikkel & Zwick, U., 2002, Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 844-851 8 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Traffic Engineering with Traditional IP Routing Protocols
Fortz, B., Rexford, J. & Thorup, Mikkel, 1 Oct 2002, In: IEEE Communications Magazine. 40, 10, p. 118-124 7 p.Research output: Contribution to journal › Journal article › Research › peer-review
ID: 34257574
Most downloads
-
2506
downloads
Coloring 3-colorable graphs with o(n 1/5) colors
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
133
downloads
Incremental exact min-cut in poly-logarithmic amortized update time
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
105
downloads
Bottleneck paths and trees and deterministic graphical games
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published