Mikkel Thorup

Mikkel Thorup

Professor

Member of:


    1. 2011
    2. Don't rush into a union: take time to find your roots

      Patrascu, M. & Thorup, Mikkel, 2011, Proceedings of the forty-third annual ACM symposium on Theory of computing. Association for Computing Machinery, p. 559-567 9 p.

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

    3. Efficient stream sampling for variance-optimal estimation of subset sums

      Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2011, In: S I A M Journal on Computing. 40, 5, p. 1402-1431 30 p.

      Research output: Contribution to journalJournal articlepeer-review

    4. The minimum k-way cut of bounded size is fixed-parameter tractable

      Kawarabayashi, K. & Thorup, Mikkel, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. Ostrovsky, R. (ed.). IEEE, p. 160-169 10 p.

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

    5. The power of simple tabulation hashing

      Patrascu, M. & Thorup, Mikkel, 2011, Proceedings of the 43rd annual ACM symposium on Theory of computing. Association for Computing Machinery, p. 1-10 10 p.

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

    6. Timeouts with time-reversed linear probing

      Thorup, Mikkel, 2011, 2011 Proceedings IEEE INFOCOM. IEEE, p. 166-170 5 p.

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

    ID: 34257574