Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    61 - 70 out of 241Page size: 10
    1. 2015
    2. Published

      Planar reachability in linear space and constant time

      Holm, Jacob, Rotenberg, E. & Thorup, Mikkel, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 370-389 20 p. (Symposium on Foundations of Computer Science. Annual Proceedings).

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

    3. Published

      RAM-efficient external memory sorting

      Arge, L. & Thorup, Mikkel, 2015, In: Algorithmica. 73, 4, p. 623-636 14 p.

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

    4. Published

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

      Thorup, Mikkel, 2015, Proceedings. 56th Annual Symposium on Foundations of Computer Science. IEEE, p. 1277-1291 15 p. (Symposium on Foundations of Computer Science. Annual Proceedings).

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

    5. 2014
    6. Published

      Algorithms and estimators for summarization of unaggregated data streams

      Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2014, In: Journal of Computer and System Sciences. 80, 7, p. 1214-1244 31 p.

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

    7. Published

      Approximately minwise independence with twisted tabulation

      Dahlgaard, S. & Thorup, Mikkel, 2014, Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. Ravi, R. & Gørtz, I. L. (eds.). Springer, p. 134-145 12 p. (Lecture notes in computer science, Vol. 8503).

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

    8. Published

      Coloring 3-colorable graphs with o(n 1/5) colors

      Kawarabayashi, K. & Thorup, Mikkel, 2014, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Mayr, E. W. & Portier, N. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 458-469 12 p. (Leibniz International Proceedings in Informatics, Vol. 25).

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

    9. Published

      Dynamic integer sets with optimal rank, select, and predecessor search

      Patrascu, M. & Thorup, Mikkel, 2014, FOCS 2014: 55th Annual Symposium on Foundations of Computer Science. IEEE, p. 166-175 10 p.

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

    10. Published

      Union-find with constant time deletions

      Alstrup, Stephen, Thorup, Mikkel, Gørtz, I. L., Rauhe, T. & Zwick, U., 2014, In: A C M Transactions on Algorithms. 11, 1, 28 p., 6.

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

    11. 2013
    12. Published

      Bottom-k and priority sampling, set similarity and subset sums with minimal independence

      Thorup, Mikkel, 2013, STOC '13: Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing. Association for Computing Machinery, p. 371-380 10 p.

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

    13. Published

      Funding successful research

      Thorup, Mikkel, 2013, In: Communications of the A C M. 56, 3, p. 38-39 2 p.

      Research output: Contribution to journal › Comment/debate › Research

    Previous 1...3 4 5 6 7 8 9 10 ...25 Next

    ID: 34257574