Research output per year
Research output per year
Personal profile
Current research
Efficient Algorithms and Data Structures.
Fingerprint
Dive into the research topics where Mikkel Thorup is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 5 Similar Profiles
-
Adjacency Labeling Schemes and Induced-Universal Graphs
Alstrup, S., Kaplan, H., Thorup, M. & Zwick, U., 2019, In: SIAM Journal on Discrete Mathematics. 33, 1, p. 116-137Research output: Contribution to journal › Journal article › Research › peer-review
-
Dynamic ordered sets with approximate queries, approximate heaps and soft heaps
Thorup, M., 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 proceeding › Article in proceedings › Research › peer-review
-
Non-empty Bins with Simple Tabulation Hashing
Aamand, A. & Thorup, M., 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-2512Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research
-
Consistent Hashing with bounded loads
Mirrokni, V., Thorup, M. & Zadimoghaddam, M., 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 587-604 18 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
-
Deterministic Edge Connectivity in Near-Linear Time
Kawarabayashi, K. & Thorup, M., Dec 2018, In: Journal of the ACM. 66, 1, p. 1-50 4.Research output: Contribution to journal › Journal article › Research › peer-review
-
Dynamic bridge-finding in Õ(log2 n) amortized time
Holm, J., Rotenberg, E. & Thorup, M., 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 35-52 18 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
-
Fast fencing
Abrahamsen, M., Adamaszek, A., Bringmann, K., Cohen-Addad, V., Mehr, M., Rotenberg, E., Roytman, A. & Thorup, M., 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 564-573Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
-
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
Goranci, G., Henzinger, M. & Thorup, M., Mar 2018, In: ACM Transactions on Algorithms. 14, 2, 17.Research output: Contribution to journal › Journal article › Research › peer-review