Mikkel Thorup
Professor
- 1990
On conservative extensions of syntax in the process of system development
Blikle, A. & Thorup, Mikkel, 1990, Proceedings of VDM'90, VDM and Z---Formal Methods in Software Development, LNCS 428. Springer, p. 504-525 22 p. (Lecture notes in computer science, Vol. 428).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Zenons paradoks -- ren logik eller snedig rethorik
Thorup, Mikkel, 1990, In: Kvant, Fysisk Tidskrift. 1, p. 24-26 3 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 1991
On conservative extensions of syntax in system development
Blikle, A., Tarlecki, A. & Thorup, Mikkel, 1991, In: Theoretical Computer Science. 90, 1, p. 209-233 25 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 1992
Ambiguity for incremental parsing and evaluation
Thorup, Mikkel, 1992, Oxford university computing laboratory.Research output: Working paper › Research
- 1993
On Shortcutting Digraphs
Thorup, Mikkel, 1993, Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 657. Springer, p. 205-211 7 p. (Lecture notes in computer science, Vol. 657).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 1994
Controlled grammatic ambiguity
Thorup, Mikkel, 1994, In: ACM Transactions on Programming Languages and Systems. 16, 3, p. 1024-1050Research output: Contribution to journal › Journal article › Research › peer-review
Efficient preprocessing of simple binary pattern forests
Thorup, Mikkel, 1994, Proceedings of the 4th Scandinavian Workshop on Algorithm Theory. Springer, p. 350-358Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › 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
Optimal evolutionary tree comparison by sparse dynamic programming
Farach, M. & Thorup, Mikkel, 1994, Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS). p. 770-779 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 1995
Computing the agreement of trees with bounded degrees
Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979. Springer, p. 381-393Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › 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
Improved Sampling with Applications to Dynamic Graph Algorithms
Henzinger, M. R. & Thorup, Mikkel, 1995.Research output: Working paper › Research
On the Agreement of Many Trees
Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, In: Information Processing Letters. p. 297-301Research output: Contribution to journal › Journal article › Research › peer-review
Shortcutting planar diagraphs
Thorup, Mikkel, 1995, In: Combinatorics, Probability & Computing. 4, p. 287-315Research output: Contribution to journal › Journal article › Research › peer-review
String Matching in Lempel-Ziv Compressed Strings
Farach, M. & Thorup, Mikkel, 1995, Proceedings of the 27th ACM Symposium on the Theory of Computing (STOC). p. 703-712 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 1996
A Pragmatic Implementation of Monotone Priority Queues
Andersson, A. & Thorup, Mikkel, 1996, In: Unpublished.Research output: Contribution to journal › Journal article › Research
Diameter and distance in dynamic trees
Alstrup, Stephen, Holm, J., Jørgensen, K. & Thorup, Mikkel, 1996.Research output: Working paper › Research
Disambiguating Grammars by Exclusion of Sub-Parse Trees
Thorup, Mikkel, 1996, In: Acta Informatica. 33, 6, p. 511-522 12 p.Research output: Contribution to journal › Journal article › Research › peer-review
Efficient preprocessing of simple binary pattern forests
Thorup, Mikkel, 1996, In: Journal of Algorithms. 20, p. 602-612 11 p.Research output: Contribution to journal › Journal article › Research › peer-review
Finding dominators in linear time
Alstrup, Stephen, Lauritzen, P. W. & Thorup, Mikkel, 1996, (DIKU Report).Research output: Working paper › Research
- Published
Generalized dominators for structured programs
Alstrup, Stephen, Lauridsen, P. W. & Thorup, Mikkel, 1996, Static Analysis. Springer Science+Business Media, p. 42-51 10 p. (Lecture notes in computer science, Vol. 1145).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Improved Sampling with Applications to Dynamic Graph Algorithms
Henzinger, M. R. & Thorup, Mikkel, 1996, Proceedings of the 23rd International Colloquium on Automata Languages, and Programming (ICALP), LNCS 1099. p. 290-299 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
On RAM Priority Queues
Thorup, Mikkel, 1996, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 59-67 9 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
On the Approximability of Numerical Taxonomy
Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M. & Thorup, Mikkel, 1996, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 365-372 8 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Alstrup, Stephen & Thorup, Mikkel, 1996, Algorithm Theory—SWAT'96. Springer Science+Business Media, p. 212-222 11 p. (Lecture notes in computer science, Vol. 1097).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Static Dictionaries on AC^0 RAMs: Query time log n/log log n) is necessary and sufficient
Andersson, A., Miltersen, P. B., Riis, S. & Thorup, Mikkel, 1996, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS). p. 441-450 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 1997
Decremental dynamic connectivity
Thorup, Mikkel, 1997, Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 305-313 9 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
- 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 proceeding › Article in proceedings › Research › peer-review
- Published
Minimizing diameters of dynamic trees
Alstrup, Stephen, Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1997, Automata, Languages and Programming. Springer Science+Business Media, p. 270-280 11 p. (Lecture notes in computer science, Vol. 1256).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations
Thorup, Mikkel, 1997, Proceedings 8th SODA AMC-SIAM . p. 352-359 8 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Undirected single source shortest paths in linear time
Thorup, Mikkel, 1997, Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, p. 12-21Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 1998
All Structured Programs have Small Tree Width and Good Register Allocation
Thorup, Mikkel, 1998, In: Information and Computation. 142, 2, p. 159-181 23 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Direct Routing on Trees
Alstrup, Stephen, Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1998, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms. p. 342-349 8 p. (9th ACM-SIAM Symposium on Discrete Algorithms (SODA)).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 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-555Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity
Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1998, Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC). ACM, p. 79-89Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
String Matching in Lempel-Ziv Compressed Strings
Farach, M. & Thorup, Mikkel, 1998, In: Algorithmica. 20, 4, p. 388-404 17 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 1999
Decremental dynamic connectivity
Thorup, Mikkel, 1999, In: Journal of Algorithms. 33, 2, p. 229-243 15 p.Research output: Contribution to journal › Journal article › Research › peer-review
Dominators in linear time
Alstrup, Stephen, Harel, D., Lauridsen, P. W. & Thorup, Mikkel, 1999, In: SIAM Journal on Computing. 28, 6, p. 2117-2132 16 p.Research output: Contribution to journal › Journal article › Research › peer-review
Fusion trees can be implemented with AC^0 instructions only
Andersson, A., Miltersen, P. B. & Thorup, Mikkel, 1999, In: Theoretical Computer Science. 215, 1-2, p. 337-344 8 p.Research output: Contribution to journal › Journal article › Research › peer-review
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M. & Thorup, Mikkel, 1999, In: SIAM Journal on Computing. 28, 3, p. 1073 - 1085Research output: Contribution to journal › Journal article › Research › peer-review
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Karger, D., Klein, P., Stein, C., Thorup, Mikkel & Young, N., 1999, Proceedings of the 31st ACM Symposium on the Theory of Computing (STOC). p. 668-678 11 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Undirected Single Source Shortest Paths with Positive Integer Weights in Linear Time
Thorup, Mikkel, 1999, In: Journal of the ACM. 46, 3, p. 362-394 33 p.Research output: Contribution to journal › Journal article › Research › peer-review
Word encoding tree connectivity works
Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 1999, In: DIKU Report.Research output: Contribution to journal › Journal article › Research
Århus-tung forskningspolitik skader (Læserbrev med journalistvalgt overskrift)
Thorup, Mikkel, 1999, In: Computerworld. 10, p. 24 (hele siden)Research output: Contribution to journal › Journal article › Research › peer-review
- 2000
An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
Cole, R., Farach, M., Hariharan, R., Przytycka, T. & Thorup, Mikkel, 2000, In: SIAM Journal on Computing. 30, 5, p. 1385-1404 20 p.Research output: Contribution to journal › Journal article › Research › peer-review
An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms
Iyer, R. D., Karger, D., Rahul, H. S. & Thorup, Mikkel, 2000, Proceedings of the 2nd Workshop on Algorithms Engineering and Experiments (ALENEX). p. 59-78 20 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Dynamic Graph Algorithms with Applications (Invited Talk)
Thorup, Mikkel & Karger, D., 2000, Proceedings of the 7th Scandinavian Workshop on Algorithms Theory (SWAT), LNCS 1851. p. 1-9 9 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › 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