Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    131 - 140 out of 242Page size: 10
    1. 2005

    2. Learn More, Sample Less: Control of Volume and Variance in Network Measurement

      Duffield, N., Lund, C. & Thorup, Mikkel, 2005, In: IEEE Transactions on Information Theory. 51, 5, p. 1756-1775 20 p.

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

    3. Maintaining information in fully dynamic trees with top trees

      Alstrup, Stephen, Holm, J., Lichtenberg, K. D. & Thorup, Mikkel, 2005, In: ACM Transactions on Algorithms (TALG). 1, 2, p. 243-264 22 p.

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

    4. Optimal Combination of Sampled Network Measurements

      Duffield, N., Lund, C. & Thorup, Mikkel, 2005, Proceedings the ACM Internet Measurement Conference (IMC). p. 91-104 14 p.

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

    5. Quick k-Median, k-Center, and Facility Location for Sparse Graphs

      Thorup, Mikkel, 2005, In: sicomp. 34, 2, p. 405-432 28 p.

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

    6. 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 proceeding › Article in proceedings › Research › peer-review

    7. 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 proceeding › Article in proceedings › Research › peer-review

    8. 2004

    9. Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

      Thorup, Mikkel, 2004, In: Journal of the ACM. 51, 6, p. 993-1024 32 p.

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

    10. Flow sampling under hard resource constraints

      Duffield, N., Lund, C. & Thorup, Mikkel, 2004, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). Association for Computing Machinery, p. 85-96 12 p.

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

    11. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles

      Thorup, Mikkel, 2004, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). Springer, p. 384-396 13 p. (Lecture notes in computer science, Vol. 3111).

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

    12. Increasing Internet Capacity Using Local Search

      Fortz, B. & Thorup, Mikkel, 2004, In: Computational Optimization and Applications. 29, 1, p. 13-48 36 p.

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

    Previous 1...10 11 12 13 14 15 16 17 ...25 Next

    ID: 34257574