Mikkel Thorup
Professor
Estimating Arbitrary Subset Sums with Few Probes
Alon, N., Duffield, N., Lund, C. & Thorup, Mikkel, 2005, Proceedings of the 24th Annual ACM Symposium on Principles of Database Systems (PODS). Association for Computing Machinery, p. 317-325 9 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Estimating Flow Distributions from Sampled Flow Statistics
Duffield, N., Lund, C. & Thorup, Mikkel, 2005, In: ACM/IEEE Transactions on Networking. 13, 5, p. 933-946 14 p.Research output: Contribution to journal › Journal article › Research › peer-review
Even Strongly Universal Hashing is Pretty Fast
Thorup, Mikkel, 2000, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 496-497 2 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Farvel til international forskning (debat-indlæg)
Thorup, Mikkel, 1997, In: Berlingske Tidende, Univers. 7. oktoberResearch output: Contribution to journal › Journal article › Research › peer-review
Fast Comparison of Evolutionary Trees
Farach, M. & Thorup, Mikkel, 1995, In: Information and Computation. 123, 1, p. 29-37 9 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Fast and powerful hashing using tabulation
Thorup, Mikkel, 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Chatzigiannakis, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2 p. 4. (Leibniz International Proceedings in Informatics, Vol. 80).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research
- Published
Fast and powerful hashing using tabulation
Thorup, Mikkel, 2016, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Lal, A., Akshay, S., Saurabh, S. & Sen, S. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2 p. 1. (Leibniz International Proceedings in Informatics, Vol. 65).Research output: Chapter in Book/Report/Conference proceeding › Conference abstract in proceedings › Research › peer-review
- Published
Fast and powerful hashing using tabulation
Thorup, Mikkel, Jul 2017, In: Communications of the ACM. 60, 7, p. 94-101 8 p.Research output: Contribution to journal › Journal article › Research › peer-review
Fast comparison of evolutionary trees
Farach, M. & Thorup, Mikkel, 1994, Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 481-488 8 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Fast fencing
Abrahamsen, Mikkel, Adamaszek, A., Bringmann, K., Cohen-Addad, V., Mehr, M., Rotenberg, E., Roytman, A. & Thorup, Mikkel, 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
ID: 34257574
Most downloads
-
2506
downloads
Coloring 3-colorable graphs with o(n 1/5) colors
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
133
downloads
Incremental exact min-cut in poly-logarithmic amortized update time
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
105
downloads
Bottleneck paths and trees and deterministic graphical games
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published