Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    41 - 50 out of 241Page size: 10
    1. 1999

    2. Dominators in linear time

      Alstrup, Stephen, Harel, D., Lauridsen, P. W. & Thorup, Mikkel, 1999, In: SIAM Journal on Computing. 28, 6, p. 2117-2132 16 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    3. Fusion trees can be implemented with AC^0 instructions only

      Andersson, A., Miltersen, P. B. & Thorup, Mikkel, 1999, In: Theoretical Computer Science. 215, 1-2, p. 337-344 8 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    4. On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)

      Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M. & Thorup, Mikkel, 1999, In: SIAM Journal on Computing. 28, 3, p. 1073 - 1085

      Research output: Contribution to journal › Journal article › Research › peer-review

    5. Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

      Karger, D., Klein, P., Stein, C., Thorup, Mikkel & Young, N., 1999, Proceedings of the 31st ACM Symposium on the Theory of Computing (STOC). p. 668-678 11 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    6. Undirected Single Source Shortest Paths with Positive Integer Weights in Linear Time

      Thorup, Mikkel, 1999, In: Journal of the ACM. 46, 3, p. 362-394 33 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    7. Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 1999, In: DIKU Report.

      Research output: Contribution to journal › Journal article › Research

    8. Århus-tung forskningspolitik skader (Læserbrev med journalistvalgt overskrift)

      Thorup, Mikkel, 1999, In: Computerworld. 10, p. 24 (hele siden)

      Research output: Contribution to journal › Journal article › Research › peer-review

    9. 2000

    10. An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

      Cole, R., Farach, M., Hariharan, R., Przytycka, T. & Thorup, Mikkel, 2000, In: SIAM Journal on Computing. 30, 5, p. 1385-1404 20 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    11. An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms

      Iyer, R. D., Karger, D., Rahul, H. S. & Thorup, Mikkel, 2000, Proceedings of the 2nd Workshop on Algorithms Engineering and Experiments (ALENEX). p. 59-78 20 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    12. Dynamic Graph Algorithms with Applications (Invited Talk)

      Thorup, Mikkel & Karger, D., 2000, Proceedings of the 7th Scandinavian Workshop on Algorithms Theory (SWAT), LNCS 1851. p. 1-9 9 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    Previous 1 2 3 4 5 6 7 8 ...25 Next

    ID: 34257574