Mikkel Thorup

Mikkel Thorup

Professor


  1. 2019
  2. Published

    Non-empty Bins with Simple Tabulation Hashing. / Aamand, Anders; Thorup, Mikkel.

    Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Timothy M. Chan. Society for Industrial and Applied Mathematics, 2019. p. 2498-2512.

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

  3. Published

    Adjacency Labeling Schemes and Induced-Universal Graphs. / Alstrup, Stephen; Kaplan, Haim; Thorup, Mikkel; Zwick, Uri.

    In: SIAM Journal on Discrete Mathematics, Vol. 33, No. 1, 2019, p. 116-137.

    Research output: Contribution to journalJournal articleResearchpeer-review

  4. Published

    Deterministic Edge Connectivity in Near-Linear Time. / Kawarabayashi, Ken-ichi; Thorup, Mikkel.

    In: Journal of the ACM, Vol. 66, No. 1, 4, 2019, p. 1-50.

    Research output: Contribution to journalJournal articleResearchpeer-review

  5. 2018
  6. Published

    Power of d choices with simple tabulation. / Aamand, Anders; Knudsen, Mathias Bæk Tejs; Thorup, Mikkel.

    45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. ed. / Christos Kaklamanis; Daniel Marx; Ioannis Chatzigiannakis; Donald Sannella. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. 5.

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

  7. Published

    Consistent Hashing with bounded loads. / Mirrokni, Vahab; Thorup, Mikkel; Zadimoghaddam, Morteza.

    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Artur Czumaj. Society for Industrial and Applied Mathematics, 2018. p. 587-604.

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

  8. Published

    Dynamic bridge-finding in Õ(log2 n) amortized time. / Holm, Jacob; Rotenberg, Eva; Thorup, Mikkel.

    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Artur Czumaj. Society for Industrial and Applied Mathematics, 2018. p. 35-52.

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

  9. Published

    Fast fencing. / Abrahamsen, Mikkel; Adamaszek, Anna; Bringmann, Karl; Cohen-Addad, Vincent; Mehr, Mehran; Rotenberg, Eva; Roytman, Alan; Thorup, Mikkel.

    STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, 2018. p. 564-573.

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

  10. Published

    Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. / Goranci, Gramoz; Henzinger, Monika; Thorup, Mikkel.

    In: ACM Transactions on Algorithms, Vol. 14, No. 2, 17, 2018.

    Research output: Contribution to journalJournal articleResearchpeer-review

  11. Published

    Proceedings, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). / Thorup, Mikkel (Editor).

    IEEE, 2018. 996 p.

    Research output: Book/ReportBookResearchpeer-review

  12. Published

    Sample(x)=(a*x <=t) is a distinguisher with probability 1/8. / Thorup, Mikkel.

    In: SIAM Journal on Computing, Vol. 47, No. 6, 2018, p. 2510-2526.

    Research output: Contribution to journalJournal articleResearchpeer-review

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

ID: 34257574