Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    51 - 60 out of 241Page size: 10
    Sort by: Title

    1. Disambiguating Grammars by Exclusion of Sub-Parse Trees

      Thorup, Mikkel, 1996, In: Acta Informatica. 33, 6, p. 511-522 12 p.

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

    2. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

      Madani, O., Thorup, Mikkel & Zwick, U., 2010, In: ACM Transactions on Algorithms. 6, 2

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

    3. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

      Madani, O., Thorup, Mikkel & Zwick, U., 2009, Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 958-967 10 p.

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

    4. Published

      Disks in Curves of Bounded Convex Curvature

      Aamand, Anders, Abrahamsen, Mikkel & Thorup, Mikkel, 2020, In: American Mathematical Monthly. 127, 7, p. 579-593 15 p.

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

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

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

    7. Don't rush into a union: take time to find your roots

      Patrascu, M. & Thorup, Mikkel, 2011, Proceedings of the forty-third annual ACM symposium on Theory of computing. Association for Computing Machinery, p. 559-567 9 p.

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

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

    9. Dynamic Ordered Sets with Exponential Search Trees

      Andersson, A. & Thorup, Mikkel, 2007, In: Journal of the ACM. 54, 3, p. Article 13

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

    10. Published

      Dynamic bridge-finding in Õ(log2 n) amortized time

      Holm, Jacob, Rotenberg, E. & Thorup, Mikkel, 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 35-52 18 p.

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

    Previous 12 3 4 5 6 7 8 9 ...25 Next

    ID: 34257574