Mikkel Thorup
Professor
- 1995
Computing the agreement of trees with bounded degrees
Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979. Springer, p. 381-393Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Fast Comparison of Evolutionary Trees
Farach, M. & Thorup, Mikkel, 1995, In: Information and Computation. 123, 1, p. 29-37 9 p.Research output: Contribution to journal › Journal article › Research › peer-review
Improved Sampling with Applications to Dynamic Graph Algorithms
Henzinger, M. R. & Thorup, Mikkel, 1995.Research output: Working paper › Research
On the Agreement of Many Trees
Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, In: Information Processing Letters. p. 297-301Research output: Contribution to journal › Journal article › Research › peer-review
Shortcutting planar diagraphs
Thorup, Mikkel, 1995, In: Combinatorics, Probability & Computing. 4, p. 287-315Research output: Contribution to journal › Journal article › Research › peer-review
String Matching in Lempel-Ziv Compressed Strings
Farach, M. & Thorup, Mikkel, 1995, Proceedings of the 27th ACM Symposium on the Theory of Computing (STOC). p. 703-712 10 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