Mikkel Thorup
Professor
- 2001
Dynamic string searching
Andersson, A. & Thorup, Mikkel, 2001, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 307-308 2 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Charging from sampled network usage
Duffield, N., Lund, C. & Thorup, Mikkel, 2001, Proceedings of the 1st ACM SIGCOMM Internet Measurement Workshop (IMW). p. 245-256 12 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity
Holm, J., Lichtenberg, K. D. & Thorup, Mikkel, 2001, In: Journal of the ACM. 48, 4, p. 723-760 38 p.Research output: Contribution to journal › Journal article › Research › peer-review
An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
Iyer, R. D., Karger, D., Rahul, H. S. & Thorup, Mikkel, 2001, In: ACM Journal of Experimental Algorithmics. 6, p. Article 4Research output: Contribution to journal › Journal article › Research › peer-review
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
King, V. & Thorup, Mikkel, 2001, Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON), LNCS 2108. p. 268-277 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Approximate Distance Oracles
Thorup, Mikkel & Zwick, U., 2001, Proceedings of the 33nd ACM Symposium on the Theory of Computing (STOC). ACM, p. 183-192 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
Thorup, Mikkel, 2001, Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS). p. 242-251 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Compact Routing Schemes
Thorup, Mikkel & Zwick, U., 2001, Proceedings of the 13nd ACM Symposium on the Parallel Algorithms and Architectures (SPAA). p. 1-10 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Fully-Dynamic Min-Cut
Thorup, Mikkel, 2001, Proceedings of the 33nd ACM Symposium on the Theory of Computing (STOC). p. 224-230 7 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
Thorup, Mikkel, 2001, Proceedings of the 28th International Colloquium on Automata Languages, and Programming (ICALP), LNCS 2076. Springer, p. 249-260 12 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