Mikkel Thorup

Mikkel Thorup

Professor

Member of:


    1. Undirected single source shortest paths in linear time

      Thorup, Mikkel, 1997, Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, p. 12-21

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    2. Published

      Union-find with constant time deletions

      Alstrup, Stephen, Gørtz, I. L., Rauhe, T., Thorup, Mikkel & Zwick, U., 2005, Automata, Languages and Programming (ICALP). Springer, p. 78-89 12 p.

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    3. Published

      Union-find with constant time deletions

      Alstrup, Stephen, Thorup, Mikkel, Gørtz, I. L., Rauhe, T. & Zwick, U., 2014, In: A C M Transactions on Algorithms. 11, 1, 28 p., 6.

      Research output: Contribution to journalJournal articleResearchpeer-review

    4. Untangling the balancing and searching of balanced binary search trees

      Austern, M. H., Stroustrup, B., Thorup, Mikkel & Wilkinson, J., 2003, In: Software: Practice & Experience. 33, 13, p. 1273-1298 26 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    5. Published

      Wireless coverage prediction via parametric shortest paths

      Applegate, D., Archer, A., Johnson, D. S., Nikolova, E., Thorup, Mikkel & Yang, G., 2018, Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, Mobihoc '18 . ACM, p. 221-230

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    6. Word encoding tree connectivity works

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

      Research output: Contribution to journalJournal articleResearch

    7. 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 proceedingArticle in proceedingsResearchpeer-review

    8. Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths

      Thorup, Mikkel, 2005, Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). Association for Computing Machinery, p. 112-119 8 p.

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    9. Published

      Worst-case union-find with fast deletions

      Alstrup, Stephen, Gørtz, I. L., Rauhe, T. & Thorup, Mikkel, 2003.

      Research output: Working paper

    10. Zenons paradoks -- ren logik eller snedig rethorik

      Thorup, Mikkel, 1990, In: Kvant, Fysisk Tidskrift. 1, p. 24-26 3 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    ID: 34257574