Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    11 - 15 out of 15Page size: 10
    1. 2003

    2. Space efficient dynamic stabbing with fast queries

      Thorup, Mikkel, 2003, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). p. 649-658 10 p.

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

    3. Traffic engineering with estimated traffic matrices

      Roughan, M., Thorup, Mikkel & Zhang, Y., 2003, Proceedings the ACM Internet Measurement Conference (IMC). p. 248-258 11 p.

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

    4. Tree based MPLS routing

      Gupta, A., Kumar, A. & Thorup, Mikkel, 2003, Proceedings of the 15th ACM Symposium on Parallel Algorithms (SPAA). Association for Computing Machinery, p. 193-199 7 p.

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

    5. 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 journal › Journal article › Research › peer-review

    6. Published

      Worst-case union-find with fast deletions

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

      Research output: Working paper › Research

    Previous 1 2 Next

    ID: 34257574