Mikkel Thorup

Mikkel Thorup

Professor


  1. 2020
  2. E-pub ahead of print

    Compact cactus representations of all non-trivial min-cuts

    Lo, O. H. S., Schmidt, J. M. & Thorup, Mikkel, 2020, In : Discrete Applied Mathematics. 9 p.

    Research output: Contribution to journalJournal articleResearchpeer-review

  3. Published

    Disks in Curves of Bounded Convex Curvature

    Aamand, Anders, Abrahamsen, Mikkel & Thorup, Mikkel, 2020, In : American Mathematical Monthly. 127, 7, p. 579-593 15 p.

    Research output: Contribution to journalJournal articleResearchpeer-review

  4. 2019
  5. Published

    Non-empty Bins with Simple Tabulation Hashing

    Aamand, Anders & Thorup, Mikkel, 2 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). Society for Industrial and Applied Mathematics, p. 2498-2512

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

  6. Published

    Adjacency Labeling Schemes and Induced-Universal Graphs

    Alstrup, Stephen, Kaplan, H., Thorup, Mikkel & Zwick, U., 2019, In : SIAM Journal on Discrete Mathematics. 33, 1, p. 116-137

    Research output: Contribution to journalJournal articleResearchpeer-review

  7. Published

    Deterministic Edge Connectivity in Near-Linear Time

    Kawarabayashi, K. & Thorup, Mikkel, 2019, In : Journal of the ACM. 66, 1, p. 1-50 4.

    Research output: Contribution to journalJournal articleResearchpeer-review

  8. Published

    Dynamic ordered sets with approximate queries, approximate heaps and soft heaps

    Thorup, Mikkel, Zamir, O. & Zwick, U., 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 p. 95. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 132).

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

  9. Published

    Hardness of bichromatic closest pair with Jaccard similarity

    Pagh, R., Stausholm, N. M. & Thorup, Mikkel, 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 p. 74. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 144).

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

  10. Published

    Random k-out subgraph leaves only O(n/k) inter-component edges

    Holm, Jacob, King, V., Thorup, Mikkel, Zamir, O. & Zwick, U., 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE, 14 p. 8948658

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

  11. 2018
  12. Published

    Power of d choices with simple tabulation

    Aamand, Anders, Knudsen, M. B. T. & Thorup, Mikkel, 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 p. 5. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 107).

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

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

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

ID: 34257574