Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    31 - 40 out of 241Page size: 10
    Sort by: Title

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

    2. Compact Routing Schemes

      Thorup, Mikkel & Zwick, U., 2001, Proceedings of the 13nd ACM Symposium on the Parallel Algorithms and Architectures (SPAA). p. 1-10 10 p.

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

    3. Published

      Compact cactus representations of all non-trivial min-cuts

      Lo, O. H. S., Schmidt, J. M. & Thorup, Mikkel, 2021, In: Discrete Applied Mathematics. 303, p. 296-304

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

    4. Compact name-independent routing with minimum stretch

      Abraham, I., Gavoille, C., Malkhi, D., Nisan, N. & Thorup, Mikkel, 2008, In: ACM Transactions on Algorithms. 4, 3, p. Article 37

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

    5. Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets

      Cohen, E., Duffield, N. G., Kaplan, H., Lund, C. & Thorup, Mikkel, 2009, In: Proceedings of Very Large Databases (VLDB) Endowment. 2, 1, p. 431-442 12 p.

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

    6. Computing the agreement of trees with bounded degrees

      Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979. Springer, p. 381-393

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

    7. Confidence Intervals for Priority Sampling

      Thorup, Mikkel, 2006, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). p. 252-263 12 p.

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

    8. Confident estimation for multistage measurement sampling and aggregation

      Cohen, E., Duffield, N., Lund, C. & Thorup, Mikkel, 2008, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). ACM, p. 109-120 12 p.

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

    9. Published

      Confirmation sampling for exact nearest neighbor search

      Christiani, T., Pagh, R. & Thorup, Mikkel, 2020, Similarity Search and Applications - 13th International Conference, SISAP 2020, Proceedings. Satoh, S., Vadicamo, L., Carrara, F., Zimek, A., Bartolini, I., Aumüller, M., Jonsson, B. P. & Pagh, R. (eds.). Springer, p. 97-110 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12440 LNCS).

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

    10. Published

      Consistent Hashing with bounded loads

      Mirrokni, V., Thorup, Mikkel & Zadimoghaddam, M., 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 587-604 18 p.

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

    Previous 1 2 3 4 5 6 7 8 ...25 Next

    ID: 34257574