Mikkel Thorup
Professor
A Memetic Algorithms for OSPF Routing
Buriol, L. S., Resende, M. G. C., Ribeiro, C. C. & Thorup, Mikkel, 2002, Proceedings of the 6th INFORMS Telecom. p. 187-188 2 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
A Pragmatic Implementation of Monotone Priority Queues
Andersson, A. & Thorup, Mikkel, 1996, In: Unpublished.Research output: Contribution to journal › Journal article › Research
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
King, V. & Thorup, Mikkel, 2001, Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON), LNCS 2108. p. 268-277 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing
Houen, J. B. T. & Thorup, Mikkel, 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 76. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 261).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing
Buriol, L. S., Resende, M. G. C., Ribeiro, C. C. & Thorup, Mikkel, 2005, In: Networks. 46, 1, p. 36-56 21 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 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
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-137Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Adjacency labeling schemes and induced-universal graphs
Alstrup, Stephen, Kaplan, H., Thorup, Mikkel & Zwick, U., 2015, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015: STOC '15. Association for Computing Machinery, p. 625-634 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Algorithms and Estimators for Accurate Summarization of Internet Traffic
Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2007, Proceedings the ACM Internet Measurement Conference (IMC). Association for Computing Machinery, p. 265-278 14 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Algorithms and estimators for summarization of unaggregated data streams
Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2014, In: Journal of Computer and System Sciences. 80, 7, p. 1214-1244 31 p.Research output: Contribution to journal › Journal article › Research › peer-review
ID: 34257574
Most downloads
-
2500
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