Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    191 - 200 out of 242Page size: 10
    1. 2000

    2. Near-optimal fully-dynamic graph connectivity

      Thorup, Mikkel, 2000, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). p. 343-350 8 p.

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

    3. On RAM Priority Queues

      Thorup, Mikkel, 2000, In: SIAM Journal on Computing. 30, 1, p. 86-109 24 p.

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

    4. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen & Thorup, Mikkel, 2000, In: Journal of Algorithms. 35, 2, p. 169-188 20 p.

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

    5. Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues

      Andersson, A. & Thorup, Mikkel, 2000, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). p. 335-342 8 p.

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

    6. Published

      Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 2000, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. p. 498-499 2 p.

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

    7. 1999

    8. Decremental dynamic connectivity

      Thorup, Mikkel, 1999, In: Journal of Algorithms. 33, 2, p. 229-243 15 p.

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

    9. 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

    10. 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

    11. 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

    12. 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

    Previous 1...16 17 18 19 20 21 22 23 ...25 Next

    ID: 34257574