Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    1 - 100 out of 241Page size: 100
    1. 1990

    2. 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

    3. 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

    4. 1991

    5. 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

    6. 1992

    7. Ambiguity for incremental parsing and evaluation

      Thorup, Mikkel, 1992, Oxford university computing laboratory.

      Research output: Working paper › Research

    8. 1993

    9. 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

    10. Topics in Computation

      Thorup, Mikkel, 1993

      Research output: Book/Report › Ph.D. thesis › Research

    11. 1994

    12. Controlled grammatic ambiguity

      Thorup, Mikkel, 1994, In: ACM Transactions on Programming Languages and Systems. 16, 3, p. 1024-1050

      Research output: Contribution to journal › Journal article › Research › peer-review

    13. Efficient preprocessing of simple binary pattern forests

      Thorup, Mikkel, 1994, Proceedings of the 4th Scandinavian Workshop on Algorithm Theory. Springer, p. 350-358

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    14. 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

    15. 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

    16. 1995

    17. An $O(loglog n)$ Priority Queue

      Thorup, Mikkel, 1995.

      Research output: Working paper › Research

    18. 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-393

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    19. 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

    20. Improved Sampling with Applications to Dynamic Graph Algorithms

      Henzinger, M. R. & Thorup, Mikkel, 1995.

      Research output: Working paper › Research

    21. On the Agreement of Many Trees

      Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, In: Information Processing Letters. p. 297-301

      Research output: Contribution to journal › Journal article › Research › peer-review

    22. Shortcutting planar diagraphs

      Thorup, Mikkel, 1995, In: Combinatorics, Probability & Computing. 4, p. 287-315

      Research output: Contribution to journal › Journal article › Research › peer-review

    23. 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

    24. 1996

    25. A Pragmatic Implementation of Monotone Priority Queues

      Andersson, A. & Thorup, Mikkel, 1996, In: Unpublished.

      Research output: Contribution to journal › Journal article › Research

    26. Diameter and distance in dynamic trees

      Alstrup, Stephen, Holm, J., Jørgensen, K. & Thorup, Mikkel, 1996.

      Research output: Working paper › Research

    27. 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

    28. 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

    29. Finding dominators in linear time

      Alstrup, Stephen, Lauritzen, P. W. & Thorup, Mikkel, 1996, (DIKU Report).

      Research output: Working paper › Research

    30. 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

    31. 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

    32. 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

    33. 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

    34. 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

    35. 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

    36. 1997

    37. 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

    38. Farvel til international forskning (debat-indlæg)

      Thorup, Mikkel, 1997, In: Berlingske Tidende, Univers. 7. oktober

      Research output: Contribution to journal › Journal article › Research › peer-review

    39. 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

    40. 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

    41. 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

    42. 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-21

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    43. 1998

    44. 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

    45. 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

    46. 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-555

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    47. 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-89

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    48. 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

    49. 1999

    50. 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

    51. 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

    52. 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

    53. 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 - 1085

      Research output: Contribution to journal › Journal article › Research › peer-review

    54. 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

    55. 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

    56. Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 1999, In: DIKU Report.

      Research output: Contribution to journal › Journal article › Research

    57. Å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

    58. 2000

    59. 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

    60. 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

    61. 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

    62. 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

    63. Floats, Integers, and Single Source Shortest Paths

      Thorup, Mikkel, 2000, In: Journal of Algorithms. 35, p. 189-201 13 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    64. Generalized Dominators for Structured Programs

      Alstrup, Stephen, Lauridsen, P. W. & Thorup, Mikkel, 2000, In: Algorithmica. 27, 3, p. 244-253 10 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    65. Internet Traffic Engineering by Optimizing OSPF Weights

      Fortz, B. & Thorup, Mikkel, 2000, Proceedings of the 19th IEEE INFOCOM - The Conference on Computer Communications. p. 519-528 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    66. Published

      Maintaining center and median in dynamic trees

      Alstrup, Stephen, Holm, Jacob & Thorup, Mikkel, 2000, Algorithm Theory-SWAT 2000. Springer Science+Business Media, Vol. 1851. p. 46-56 11 p. (Lecture notes in computer science).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    67. Near-optimal fully-dynamic graph connectivity

      Thorup, Mikkel, 2000, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). p. 343-350 8 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    68. On RAM Priority Queues

      Thorup, Mikkel, 2000, In: SIAM Journal on Computing. 30, 1, p. 86-109 24 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    69. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen & Thorup, Mikkel, 2000, In: Journal of Algorithms. 35, 2, p. 169-188 20 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    70. Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues

      Andersson, A. & Thorup, Mikkel, 2000, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). p. 335-342 8 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    71. Published

      Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 2000, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. p. 498-499 2 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    72. 2001

    73. 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

    74. An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms

      Iyer, R. D., Karger, D., Rahul, H. S. & Thorup, Mikkel, 2001, In: ACM Journal of Experimental Algorithmics. 6, p. Article 4

      Research output: Contribution to journal › Journal article › Research › peer-review

    75. Approximate Distance Oracles

      Thorup, Mikkel & Zwick, U., 2001, Proceedings of the 33nd ACM Symposium on the Theory of Computing (STOC). ACM, p. 183-192 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    76. Charging from sampled network usage

      Duffield, N., Lund, C. & Thorup, Mikkel, 2001, Proceedings of the 1st ACM SIGCOMM Internet Measurement Workshop (IMW). p. 245-256 12 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    77. Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

      Thorup, Mikkel, 2001, Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS). p. 242-251 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    78. Compact Routing Schemes

      Thorup, Mikkel & Zwick, U., 2001, Proceedings of the 13nd ACM Symposium on the Parallel Algorithms and Architectures (SPAA). p. 1-10 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    79. Dynamic string searching

      Andersson, A. & Thorup, Mikkel, 2001, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 307-308 2 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    80. Fully-Dynamic Min-Cut

      Thorup, Mikkel, 2001, Proceedings of the 33nd ACM Symposium on the Theory of Computing (STOC). p. 224-230 7 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    81. Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity

      Holm, J., Lichtenberg, K. D. & Thorup, Mikkel, 2001, In: Journal of the ACM. 48, 4, p. 723-760 38 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    82. Quick k-Median, k-Center, and Facility Location for Sparse Graphs

      Thorup, Mikkel, 2001, Proceedings of the 28th International Colloquium on Automata Languages, and Programming (ICALP), LNCS 2076. Springer, p. 249-260 12 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    83. 2002

    84. 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

    85. Efficient tree layout in a multilevel memory hierarchy

      Alstrup, Stephen, Bender, M. A., Demaine, E. D., Farach-Colton, M., Rauhe, T. & Thorup, Mikkel, 2002, In: arXiv preprint cs/0211010.

      Research output: Contribution to journal › Journal article › Research

    86. Equivalence between Priority Queues and Sorting

      Thorup, Mikkel, 2002, Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). p. 125-134 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    87. Integer Sorting in O(nlog log n) Expected Time and Linear Space

      Han, Y. & Thorup, Mikkel, 2002, Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS). p. 135-144 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    88. On Distance Oracles and Routing in Graphs (Invited Talk)

      Thorup, Mikkel, 2002, Proceedings of the 10th Annual European Symposium on Algorithms (ESA), LNCS 2461. p. 4 1 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    89. Optimizing OSPF/IS-IS weights in a changing world

      Fortz, B. & Thorup, Mikkel, 2002, In: IEEE Journal on Selected Areas in Communications (Special Issue on Recent Advances on Fundamentals of Network Management). 20, 4, p. 756-767 12 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    90. Oracles for Distances Avoiding a Link-Failure

      Demetrescu, C. & Thorup, Mikkel, 2002, Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 838-843 6 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    91. Properties and Prediction of Flow Statistics from Sampled Packet Streams

      Duffield, N., Lund, C. & Thorup, Mikkel, 2002, Proceedings of the 2nd ACM SIGCOMM Internet Measurement Workshop (IMW). p. 159-171 13 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    92. Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations

      Thorup, Mikkel, 2002, In: Journal of Algorithms. 42, 2, p. 205-230 26 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    93. Roundtrip Spanners and Roundtrip Routing in Directed Graphs

      Roditty, L., Thorup, Mikkel & Zwick, U., 2002, Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 844-851 8 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    94. Traffic Engineering with Traditional IP Routing Protocols

      Fortz, B., Rexford, J. & Thorup, Mikkel, 1 Oct 2002, In: IEEE Communications Magazine. 40, 10, p. 118-124 7 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    95. 2003

    96. Combinatorial power in multimedia processors

      Thorup, Mikkel, 2003, In: Operating Systems Review. 31, 5, p. 5-11 7 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    97. Integer priority queues with decrease key in constant time and the single source shortest paths problem

      Thorup, Mikkel, 2003, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). p. 149-158 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    98. Load optimal MPLS routing with N+M labels

      Applegate, D. & Thorup, Mikkel, 2003, Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). p. 555-565 11 p. (I E E E Infocom. Proceedings).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    99. Meldable RAM priority queues and minimum directed spanning trees

      Mendelson, R., Thorup, Mikkel & Zwick, U., 2003, Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 40-48 9 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    100. OPT versus LOAD in dynamic storage allocation

      Buchsbaum, A. L., Karloff, H. J., Kenyon, C., Reingold, N. & Thorup, Mikkel, 2003, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). p. 649-658 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    101. On AC^0Implementations of Fusion Trees and Atomic Heaps

      Thorup, Mikkel, 2003, Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 699-707 9 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    102. Performance of estimated traffic matrices in traffic engineering

      Roughan, M., Thorup, Mikkel & Zhang, Y., 2003, Proceedings of the International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS). p. 326-327 2 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    103. Quick and Good Facility Location

      Thorup, Mikkel, 2003, Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 178-185 8 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    104. Space efficient dynamic stabbing with fast queries

      Thorup, Mikkel, 2003, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). p. 649-658 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    105. Traffic engineering with estimated traffic matrices

      Roughan, M., Thorup, Mikkel & Zhang, Y., 2003, Proceedings the ACM Internet Measurement Conference (IMC). p. 248-258 11 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    106. Tree based MPLS routing

      Gupta, A., Kumar, A. & Thorup, Mikkel, 2003, Proceedings of the 15th ACM Symposium on Parallel Algorithms (SPAA). Association for Computing Machinery, p. 193-199 7 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    107. Untangling the balancing and searching of balanced binary search trees

      Austern, M. H., Stroustrup, B., Thorup, Mikkel & Wilkinson, J., 2003, In: Software: Practice & Experience. 33, 13, p. 1273-1298 26 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    108. Published

      Worst-case union-find with fast deletions

      Alstrup, Stephen, Gørtz, I. L., Rauhe, T. & Thorup, Mikkel, 2003.

      Research output: Working paper › Research

    109. OSPF Areas Considered Harmful

      Thorup, Mikkel, 1 Apr 2003

      Research output: Other contribution › Research

    110. Robust optimization of OSPF/IS-IS weights

      Fortz, B. & Thorup, Mikkel, 1 Oct 2003, Proceedings of the International Network Optimization Conference (INOC). Ben-Ameur, W. & Petrowski, A. (eds.). p. 225-230 6 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    111. 2004

    112. Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

      Thorup, Mikkel, 2004, In: Journal of the ACM. 51, 6, p. 993-1024 32 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    113. Flow sampling under hard resource constraints

      Duffield, N., Lund, C. & Thorup, Mikkel, 2004, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). Association for Computing Machinery, p. 85-96 12 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    114. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles

      Thorup, Mikkel, 2004, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). Springer, p. 384-396 13 p. (Lecture notes in computer science, Vol. 3111).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    115. Increasing Internet Capacity Using Local Search

      Fortz, B. & Thorup, Mikkel, 2004, In: Computational Optimization and Applications. 29, 1, p. 13-48 36 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    Previous 1 2 3 Next

    ID: 34257574