Mikkel Thorup

Mikkel Thorup

Professor

Member of:


    1. 1998
    2. All Structured Programs have Small Tree Width and Good Register Allocation

      Thorup, Mikkel, 1998, In: Information and Computation. 142, 2, p. 159-181 23 p.

      Research output: Contribution to journalJournal articlepeer-review

    3. Published

      Direct Routing on Trees

      Alstrup, Stephen, Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1998, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms. p. 342-349 8 p. (9th ACM-SIAM Symposium on Discrete Algorithms (SODA)).

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

    4. Published

      Faster deterministic sorting and priority queues in linear space

      Thorup, Mikkel, 1998, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 550-555

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

    5. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity

      Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1998, Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC). ACM, p. 79-89

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

    6. Published

      String Matching in Lempel-Ziv Compressed Strings

      Farach, M. & Thorup, Mikkel, 1998, In: Algorithmica. 20, 4, p. 388-404 17 p.

      Research output: Contribution to journalJournal articlepeer-review

    ID: 34257574