Mikkel Thorup
Professor
ORCID: 0000-0001-5237-1709
1 - 4 out of 4Page size: 10
- 2012
- Published
A new infinity of distance oracles for sparse graphs
Patrascu, M., Roditty, L. & Thorup, Mikkel, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 738-747 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Combinatorial coloring of 3-colorable graphs
Kawarabayashi, K. & Thorup, Mikkel, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. IEEE, p. 68-75 8 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
Thorup, Mikkel & Zhang, Y., 2012, In: S I A M Journal on Computing. 41, 2, p. 293-331 39 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
The power of simple tabulation hashing
Patracu, M. & Thorup, Mikkel, 2012, In: Association for Computing Machinery. Journal. 59, 3, 50 p., 14.Research output: Contribution to journal › Journal article › Research › peer-review
ID: 34257574
Most downloads
-
2501
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 -
132
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 -
104
downloads
Bottleneck paths and trees and deterministic graphical games
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published