Mikkel Thorup
Professor
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths
Demetrescu, C., Faruolo, P., Italiano, G. F. & Thorup, Mikkel, 2006, Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168. p. 556-579 24 p. (Lecture notes in computer science, Vol. 4168).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Melding Priority Queues
Mendelson, R., Tarjan, R., Thorup, Mikkel & Zwick, U., 2006, In: ACM Transactions on Algorithms. 2, 4, p. 535-557 23 p.Research output: Contribution to journal › Conference article › Research › peer-review
Time-Space Trade-Offs for Predecessor Search
Patracu, M. & Thorup, Mikkel, 2006, Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC). p. 232-240 9 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
Patracu, M. & Thorup, Mikkel, 2006, Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS). p. 646-654 9 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Confidence Intervals for Priority Sampling
Thorup, Mikkel, 2006, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). p. 252-263 12 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Spanners and emulators with sublinear distance errors
Thorup, Mikkel & Zwick, U., 2006, Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 802-809 8 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › 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