Mikkel Thorup

Mikkel Thorup

Professor

Member of:


    1. 2020
    2. Published

      Fast hashing with strong concentration bounds

      Aamand, Anders, Houen, Jakob Bæk Tejs, Knudsen, M. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1265-1278 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    3. Published

      Faster algorithms for edge connectivity via random 2-out contractions

      Ghaffari, M., Nowicki, K. & Thorup, Mikkel, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1260-1279 20 p.

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

    4. Published
    5. Published

      Three-in-a-tree in near linear time

      Lai, K. Y., Lu, H. I. & Thorup, Mikkel, 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1279-1292 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    6. 2019
    7. 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

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

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

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

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

    12. Published

      Heavy hitters via cluster-preserving clustering

      Larsen, K. G., Nelson, J., Nguyễn, H. L. & Thorup, Mikkel, 2019, In: Communications of the ACM. 62, 8, p. 95-100

      Research output: Contribution to journalJournal articleResearchpeer-review

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

    ID: 34257574