Mikkel Thorup

Mikkel Thorup

Professor

Member of:


    1. Published

      Fast hashing with strong concentration bounds

      Aamand, Anders, Knudsen, J. B. T., 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

    2. Published

      Fast similarity sketching

      Dahlgaard, S., Knudsen, M. B. T. & Thorup, Mikkel, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 663-671 9 p.

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

    3. Faster Regular Expression Matching

      Bille, P. & Thorup, Mikkel, 2009, Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 5555. Springer, p. 171-182 12 p.

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

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

    5. Published

      Faster deterministic sorting and priority queues in linear space

      Thorup, Mikkel, 1998, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 550-555

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

    6. Published

      Faster worst case deterministic dynamic connectivity

      Kejlberg-Rasmussen, C., Kopelowitz, T., Pettie, S. & Thorup, Mikkel, 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 53:1-53:15 15 p. 53. (Leibniz International Proceedings in Informatics, Vol. 57).

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

    7. Published

      Finding cores of limited length

      Alstrup, Stephen, Lauridsen, P. W., Sommerlund, P. & Thorup, Mikkel, 1997, Proceedings of the 5th International Workshop on Algorithms and Data Structures (WADS). Springer, Vol. 1272. p. 45-54 11 p. (Lecture notes in computer science).

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

    8. Finding dominators in linear time

      Alstrup, Stephen, Lauritzen, P. W. & Thorup, Mikkel, 1996, (DIKU Report).

      Research output: Working paperResearch

    9. Published

      Finding the maximum subset with bounded convex curvature

      Abrahamsen, Mikkel & Thorup, Mikkel, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 4. (Leibniz International Proceedings in Informatics, Vol. 51).

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

    10. Published

      Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor

      Cohen-Addad, V., Das, D., Kipouridis, Evangelos, Parotsidis, N. & Thorup, Mikkel, 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 1-12

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

    Previous 1...5 6 7 8 9 10 11 12 ...25 Next

    ID: 34257574