The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mikkel Thorup: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mikkel Thorup
    On RAM Priority Queues. [Citation Graph (1, 0)][DBLP]
    SODA, 1996, pp:59-67 [Conf]
  2. Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. [Citation Graph (1, 0)][DBLP]
    STOC, 1998, pp:79-89 [Conf]
  3. Valerie King, Mikkel Thorup
    A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:268-277 [Conf]
  4. Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup
    Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:732-743 [Conf]
  5. Martin Farach, Teresa M. Przytycka, Mikkel Thorup
    Computing the Agreement of Trees with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:381-393 [Conf]
  6. Anna Pagh, Rasmus Pagh, Mikkel Thorup
    On Adaptive Integer Sorting. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:556-579 [Conf]
  7. Mikkel Thorup
    On Distance Oracles and Routing in Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:4- [Conf]
  8. Andrzej Blikle, Mikkel Thorup
    On Conservative Extensions of Syntax in the Process of System Development. [Citation Graph (0, 0)][DBLP]
    VDM Europe, 1990, pp:504-525 [Conf]
  9. Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup
    Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:441-450 [Conf]
  10. Martin Farach, Mikkel Thorup
    Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:770-779 [Conf]
  11. Yijie Han, Mikkel Thorup
    Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:135-144 [Conf]
  12. Mikkel Thorup
    Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:242-251 [Conf]
  13. Mikkel Thorup
    Equivalence between Priority Queues and Sorting. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:125-134 [Conf]
  14. Mikkel Thorup
    Undirected Single Source Shortest Path in Linear Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:12-21 [Conf]
  15. Mikkel Thorup
    Map Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:396-405 [Conf]
  16. Mihai Patrascu, Mikkel Thorup
    Higher Lower Bounds for Near-Neighbor and Further Rich Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:646-654 [Conf]
  17. Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
    Union-Find with Constant Time Deletions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:78-89 [Conf]
  18. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Minimizing Diameters of Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:270-280 [Conf]
  19. Monika Rauch Henzinger, Mikkel Thorup
    Improved Sampling with Applications to Dynamic Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:290-299 [Conf]
  20. Liam Roditty, Mikkel Thorup, Uri Zwick
    Deterministic Constructions of Approximate Distance Oracles and Spanners. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:261-272 [Conf]
  21. Mikkel Thorup
    Quick k-Median, k-Center, and Facility Location for Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:249-260 [Conf]
  22. Matthew Roughan, Mikkel Thorup, Yin Zhang
    Traffic engineering with estimated traffic matrices. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Comference, 2003, pp:248-258 [Conf]
  23. Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Properties and prediction of flow statistics from sampled packet streams. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Workshop, 2002, pp:159-171 [Conf]
  24. Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Optimal Combination of Sampled Network Measurements. [Citation Graph (0, 0)][DBLP]
    Internet Measurment Conference, 2005, pp:91-104 [Conf]
  25. Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Charging from sampled network usage. [Citation Graph (0, 0)][DBLP]
    Internet Measurement Workshop, 2001, pp:245-256 [Conf]
  26. David Applegate, Mikkel Thorup
    Load optimal MPLS routing with N+M labels. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  27. Bernard Fortz, Mikkel Thorup
    Internet Traffic Engineering by Optimizing OSPF Weights. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:519-528 [Conf]
  28. Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Estimating arbitrary subset sums with few probes. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:317-325 [Conf]
  29. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup
    Generalized Dominators for Structured Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:42-51 [Conf]
  30. Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Estimating flow distributions from sampled flow statistics. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2003, pp:325-336 [Conf]
  31. Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Flow sampling under hard resource constraints. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2004, pp:85-96 [Conf]
  32. Matthew Roughan, Mikkel Thorup, Yin Zhang
    Performance of estimated traffic matrices in traffic engineering. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2003, pp:326-327 [Conf]
  33. Mikkel Thorup
    Confidence intervals for priority sampling. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2006, pp:252-263 [Conf]
  34. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Direct Routing on Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:342-349 [Conf]
  35. Stephen Alstrup, Jens P. Secher, Mikkel Thorup
    Word encoding tree connectivity works. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:498-499 [Conf]
  36. Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup
    On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:365-372 [Conf]
  37. Arne Andersson, Mikkel Thorup
    Dynamic string searching. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:307-308 [Conf]
  38. Camil Demetrescu, Mikkel Thorup
    Oracles for distances avoiding a link-failure. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:838-843 [Conf]
  39. Martin Farach, Mikkel Thorup
    Fast Comparison of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:481-488 [Conf]
  40. Ran Mendelson, Mikkel Thorup, Uri Zwick
    Meldable RAM priority queues and minimum directed spanning trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:40-48 [Conf]
  41. Liam Roditty, Mikkel Thorup, Uri Zwick
    Roundtrip spanners and roundtrip routing in directed graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:844-851 [Conf]
  42. Mikkel Thorup
    Even strongly universal hashing is pretty fast. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:496-497 [Conf]
  43. Mikkel Thorup
    Quick and good facility location. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:178-185 [Conf]
  44. Mikkel Thorup
    On AC0 implementations of fusion trees and atomic heaps. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:699-707 [Conf]
  45. Mikkel Thorup
    Decremental Dynamic Connectivity. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:305-313 [Conf]
  46. Mikkel Thorup
    Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:352-359 [Conf]
  47. Mikkel Thorup
    Faster Deterministic Sorting and Priority Queues in Linear Space. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:550-555 [Conf]
  48. Mikkel Thorup, Yin Zhang
    Tabulation based 4-universal hashing with applications to second moment estimation. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:615-624 [Conf]
  49. Mikkel Thorup, Uri Zwick
    Spanners and emulators with sublinear distance errors. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:802-809 [Conf]
  50. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
    Compact name-independent routing with minimum stretch. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:20-24 [Conf]
  51. Anupam Gupta, Amit Kumar, Mikkel Thorup
    Tree based MPLS routing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:193-199 [Conf]
  52. Mikkel Thorup, Uri Zwick
    Compact routing schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:1-10 [Conf]
  53. Mikkel Thorup
    Floats, Integers, and Single Source Shortest Paths. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:14-24 [Conf]
  54. Arne Andersson, Mikkel Thorup
    Tight(er) worst-case bounds on dynamic searching and priority queues. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:335-342 [Conf]
  55. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
    OPT versus LOAD in dynamic storage allocation. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:556-564 [Conf]
  56. Martin Farach, Mikkel Thorup
    String matching in Lempel-Ziv compressed strings. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:703-712 [Conf]
  57. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
    Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:668-678 [Conf]
  58. Mihai Patrascu, Mikkel Thorup
    Time-space trade-offs for predecessor search. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:232-240 [Conf]
  59. Mikkel Thorup
    Space efficient dynamic stabbing with fast queries. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:649-658 [Conf]
  60. Mikkel Thorup
    Near-optimal fully-dynamic graph connectivity. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:343-350 [Conf]
  61. Mikkel Thorup
    Fully-dynamic min-cut. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:224-230 [Conf]
  62. Mikkel Thorup
    Integer priority queues with decrease key in constant time and the single source shortest paths problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:149-158 [Conf]
  63. Mikkel Thorup
    Worst-case update times for fully-dynamic all-pairs shortest paths. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:112-119 [Conf]
  64. Mikkel Thorup, Uri Zwick
    Approximate distance oracles. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:183-192 [Conf]
  65. Stephen Alstrup, Jacob Holm, Mikkel Thorup
    Maintaining Center and Median in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:46-56 [Conf]
  66. Stephen Alstrup, Mikkel Thorup
    Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:212-222 [Conf]
  67. Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
    Melding Priority Queues. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:223-235 [Conf]
  68. Mikkel Thorup
    Dynamic Graph Algorithms with Applications. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:1-9 [Conf]
  69. Mikkel Thorup
    Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:384-396 [Conf]
  70. Mikkel Thorup
    Efficient Preprocessing of Simple Binary Pattern Forests. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:350-358 [Conf]
  71. Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup
    Finding Cores of Limited Length. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:45-54 [Conf]
  72. Mikkel Thorup
    On Shortcutting Digraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:205-211 [Conf]
  73. Mikkel Thorup
    Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:318-332 [Conf]
  74. Mikkel Thorup
    Disambiguating Grammars by Exclusion of Sub-Parse Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:6, pp:511-522 [Journal]
  75. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup
    Generalized Dominators for Structured Programs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:244-253 [Journal]
  76. Martin Farach, Mikkel Thorup
    String Matching in Lempel-Ziv Compressed Strings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:4, pp:388-404 [Journal]
  77. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
    Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  78. Arne Andersson, Mikkel Thorup
    Dynamic Ordered Sets with Exponential Search Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  79. Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup
    Efficient Tree Layout in a Multilevel Memory Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  80. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Maintaining Information in Fully-Dynamic Trees with Top Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  81. Mikkel Thorup
    Shortcutting Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:287-315 [Journal]
  82. Martin Farach, Mikkel Thorup
    Fast Comparison of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:29-37 [Journal]
  83. Mikkel Thorup
    All Structured Programs have Small Tree-Width and Good Register Allocation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:142, n:2, pp:159-181 [Journal]
  84. Martin Farach, Teresa M. Przytycka, Mikkel Thorup
    On the Agreement of Many Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:6, pp:297-301 [Journal]
  85. Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:4, pp:723-760 [Journal]
  86. Mikkel Thorup
    Compact oracles for reachability and approximate distances in planar digraphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:993-1024 [Journal]
  87. Mikkel Thorup
    Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:3, pp:362-394 [Journal]
  88. Mikkel Thorup, Uri Zwick
    Approximate distance oracles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:1, pp:1-24 [Journal]
  89. Stephen Alstrup, Mikkel Thorup
    Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:2, pp:169-188 [Journal]
  90. Mikkel Thorup
    Floats, Integers, and Single Source Shortest Paths. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:2, pp:189-201 [Journal]
  91. Mikkel Thorup
    Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:2, pp:205-230 [Journal]
  92. Mikkel Thorup
    Efficient Preprocessing of Simple Binay Pattern Forests. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:3, pp:602-612 [Journal]
  93. Mikkel Thorup
    Parallel Shortcutting of Rooted Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:1, pp:139-159 [Journal]
  94. Mikkel Thorup
    Decremental Dynamic Connectivity. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:2, pp:229-243 [Journal]
  95. Mikkel Thorup
    Integer priority queues with decrease key in constant time and the single source shortest paths problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:330-353 [Journal]
  96. Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup
    An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:4- [Journal]
  97. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
    Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:3, pp:436-461 [Journal]
  98. Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup
    A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:46, n:1, pp:36-56 [Journal]
  99. Monika Rauch Henzinger, Mikkel Thorup
    Sampling to provide or to bound: With applications to fully dynamic graph algorithms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:4, pp:369-379 [Journal]
  100. Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup
    Dominators in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2117-2132 [Journal]
  101. Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup
    On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:3, pp:1073-1085 [Journal]
  102. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
    OPT Versus LOAD in Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:632-646 [Journal]
  103. Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup
    An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1385-1404 [Journal]
  104. Martin Farach, Mikkel Thorup
    Sparse Dynamic Programming for Evolutionary-Tree Comparison. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:210-230 [Journal]
  105. Mikkel Thorup
    On RAM Priority Queues. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:86-109 [Journal]
  106. Mikkel Thorup
    Quick k-Median, k-Center, and Facility Location for Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:405-432 [Journal]
  107. Mikkel Thorup
    Combinatorial power in multimedia processors. [Citation Graph (0, 0)][DBLP]
    SIGARCH Computer Architecture News, 2003, v:31, n:4, pp:5-11 [Journal]
  108. Matthew H. Austern, Bjarne Stroustrup, Mikkel Thorup, John Wilkinson
    Untangling the balancing and searching of balanced binary search trees. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2003, v:33, n:13, pp:1273-1298 [Journal]
  109. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Maintaining information in fully dynamic trees with top trees. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:243-264 [Journal]
  110. Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
    Black box for constant-time insertion in priority queues (note). [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:102-106 [Journal]
  111. Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
    Melding priority queues. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:535-556 [Journal]
  112. Arne Andersson, Peter Bro Miltersen, Mikkel Thorup
    Fusion Trees can be Implemented with AC0 Instructions Only. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:337-344 [Journal]
  113. Andrzej Blikle, Andrzej Tarlecki, Mikkel Thorup
    On Conservative Extensions of Syntax in System Development. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:1, pp:209-233 [Journal]
  114. Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Learn more, sample less: control of volume and variance in network measurement. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:5, pp:1756-1775 [Journal]
  115. Nick G. Duffield, Carsten Lund, Mikkel Thorup
    Estimating flow distributions from sampled flow statistics. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:5, pp:933-946 [Journal]
  116. Mikkel Thorup
    Controlled Grammatic Ambiguity. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:1024-1050 [Journal]
  117. Mikkel Thorup
    Compact Oracles for Approximate Distances Around Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:383-394 [Conf]
  118. Mario Szegedy, Mikkel Thorup
    On the Variance of Subset Sum Estimation. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:75-86 [Conf]
  119. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
    Sketching unaggregated data streams for subpopulation-size queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:253-262 [Conf]
  120. Mihai Patrascu, Mikkel Thorup
    Randomization does not help searching predecessors. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:555-564 [Conf]
  121. Mikkel Thorup
    Fully-Dynamic Min-Cut. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:91-127 [Journal]
  122. Mario Szegedy, Mikkel Thorup
    On the variance of subset sum estimation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  123. Mihai Patrascu, Mikkel Thorup
    Time-Space Trade-Offs for Predecessor Search [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  124. Arne Andersson, Mikkel Thorup
    Dynamic ordered sets with exponential search trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:3, pp:13- [Journal]

  125. Tabulation Based 5-Universal Hashing and Linear Probing. [Citation Graph (, )][DBLP]


  126. Planning for Fast Connectivity Updates. [Citation Graph (, )][DBLP]


  127. Faster Regular Expression Matching. [Citation Graph (, )][DBLP]


  128. On the k-Independence Required by Linear Probing and Minwise Independence. [Citation Graph (, )][DBLP]


  129. Algorithms and estimators for accurate summarization of internet traffic. [Citation Graph (, )][DBLP]


  130. Confident estimation for multistage measurement sampling and aggregation. [Citation Graph (, )][DBLP]


  131. Maximum overhang. [Citation Graph (, )][DBLP]


  132. Stream sampling for variance-optimal estimation of subset sums. [Citation Graph (, )][DBLP]


  133. String hashing for linear probing. [Citation Graph (, )][DBLP]


  134. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. [Citation Graph (, )][DBLP]


  135. Regular Expression Matching with Multi-Strings and Intervals. [Citation Graph (, )][DBLP]


  136. Minimum k-way cuts via deterministic greedy tree packing. [Citation Graph (, )][DBLP]


  137. Changing base without losing space. [Citation Graph (, )][DBLP]


  138. Intra-domain traffic engineering with shortest path routing protocols. [Citation Graph (, )][DBLP]


  139. Sampling to estimate arbitrary subset sums [Citation Graph (, )][DBLP]


  140. Variance optimal sampling based estimation of subset sums [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002