Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    51 - 100 out of 241Page size: 50
    1. 2000

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

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

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

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

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

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

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

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

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

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

    12. 2001

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

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

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

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

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

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

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

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

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

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

    23. 2002

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

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

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

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

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

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

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

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

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

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

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

    35. 2003

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

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

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

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

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

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

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

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

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

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

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

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

    48. Published

      Worst-case union-find with fast deletions

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

      Research output: Working paper › Research

    49. OSPF Areas Considered Harmful

      Thorup, Mikkel, 1 Apr 2003

      Research output: Other contribution › Research

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

    51. 2004

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

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

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

    55. 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 4 5 Next

    ID: 34257574