2013
172Intra-domain traffic engineering with shortest path routing protocols. Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit. Annals OR (204): 65-95 (2013). Web SearchBibTeXDownload
171Funding successful research. Mikkel Thorup. Commun. ACM (56): 38-39 (2013). Web SearchBibTeXDownload
170On the k-Independence Required by Linear Probing and Minwise Independence. Mihai Patrascu, Mikkel Thorup. CoRR (abs/1302.5127) (2013). Web SearchBibTeXDownload
169Bottom-k and Priority Sampling, Set Similarity and Subset Sums with Minimal Independence. Mikkel Thorup. CoRR (abs/1303.5479) (2013). Web SearchBibTeXDownload
168More Compact Oracles for Approximate Distances in Undirected Planar Graphs. Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup. SODA 2013, 550-563. Web SearchBibTeXDownload
167Twisted Tabulation Hashing. Mihai Patrascu, Mikkel Thorup. SODA 2013, 209-228. Web SearchBibTeXDownload
166Bottom-k and priority sampling, set similarity and subset sums with minimal independence. Mikkel Thorup. STOC 2013, 371-380. Web SearchBibTeXDownload
2012
165Combinatorial coloring of 3-colorable graphs. Ken-ichi Kawarabayashi, Mikkel Thorup. CoRR (abs/1205.1254) (2012). Web SearchBibTeXDownload
164A New Infinity of Distance Oracles for Sparse Graphs. Mihai Patrascu, Liam Roditty, Mikkel Thorup. FOCS 2012, 738-747. Web SearchBibTeXDownload
163Combinatorial Coloring of 3-Colorable Graphs. Ken-ichi Kawarabayashi, Mikkel Thorup. FOCS 2012, 68-75. Web SearchBibTeXDownload
162The Power of Simple Tabulation Hashing. Mihai Patrascu, Mikkel Thorup. J. ACM (59): 14 (2012). Web SearchBibTeXDownload
161Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation. Mikkel Thorup, Yin Zhang. SIAM J. Comput. (41): 293-331 (2012). Web SearchBibTeXDownload
2011
160Don't Rush into a Union: Take Time to Find Your Roots. Mihai Patrascu, Mikkel Thorup. CoRR (abs/1102.1783) (2011). Web SearchBibTeXDownload
159Minimum k-way cut of bounded size is fixed-parameter tractable. Ken-ichi Kawarabayashi, Mikkel Thorup. CoRR (abs/1101.4689) (2011). Web SearchBibTeXDownload
158The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. Ken-ichi Kawarabayashi, Mikkel Thorup. FOCS 2011, 160-169. Web SearchBibTeXDownload
157Timeouts with time-reversed linear probing. Mikkel Thorup. INFOCOM 2011, 166-170. Web SearchBibTeXDownload
156Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. SIAM J. Comput. (40): 1402-1431 (2011). Web SearchBibTeXDownload
155Don't rush into a union: take time to find your roots. Mihai Patrascu, Mikkel Thorup. STOC 2011, 559-568. Web SearchBibTeXDownload
154The power of simple tabulation hashing. Mihai Patrascu, Mikkel Thorup. STOC 2011, 1-10. Web SearchBibTeXDownload
2010
153Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. Omid Madani, Mikkel Thorup, Uri Zwick. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
152Tabulation Based 5-Universal Hashing and Linear Probing. Mikkel Thorup, Yin Zhang. ALENEX 2010, 62-76. Web SearchBibTeXDownload
151The Power of Simple Tabulation Hashing. Mihai Patrascu, Mikkel Thorup. CoRR (abs/1011.5200) (2010). Web SearchBibTeXDownload
150On the k-Independence Required by Linear Probing and Minwise Independence. Mihai Patrascu, Mikkel Thorup. ICALP (1) 2010, 715-726. Web SearchBibTeXDownload
149Regular Expression Matching with Multi-Strings and Intervals. Philip Bille, Mikkel Thorup. SODA 2010, 1297-1308. Web SearchBibTeXDownload
148Changing base without losing space. Yevgeniy Dodis, Mihai Patrascu, Mikkel Thorup. STOC 2010, 593-602. Web SearchBibTeXDownload
2009
147Intra-domain traffic engineering with shortest path routing protocols. Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit. 4OR (7): 301-335 (2009). Web SearchBibTeXDownload
146Faster Regular Expression Matching. Philip Bille, Mikkel Thorup. ICALP (1) 2009, 171-182. Web SearchBibTeXDownload
145Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PVLDB (2): 431-442 (2009). Web SearchBibTeXDownload
144Higher Lower Bounds for Near-Neighbor and Further Rich Problems. Mihai Patrascu, Mikkel Thorup. SIAM J. Comput. (39): 730-741 (2009). Web SearchBibTeXDownload
143String hashing for linear probing. Mikkel Thorup. SODA 2009, 655-664. Web SearchBibTeXDownload
142Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. Omid Madani, Mikkel Thorup, Uri Zwick. SODA 2009, 958-967. Web SearchBibTeXDownload
141Stream sampling for variance-optimal estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. SODA 2009, 1255-1264. Cited by 2Web SearchBibTeXDownload
140Maximum Overhang. Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick. The American Mathematical Monthly (116): 763-787 (2009). Web SearchBibTeXDownload
2008
139Compact name-independent routing with minimum stretch. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
138Roundtrip spanners and roundtrip routing in directed graphs. Liam Roditty, Mikkel Thorup, Uri Zwick. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
137Variance optimal sampling based estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. CoRR (abs/0803.0473) (2008). Cited by 3Web SearchBibTeXDownload
136Speeding Up Dynamic Shortest-Path Algorithms. Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup. INFORMS Journal on Computing (20): 191-204 (2008). Web SearchBibTeXDownload
135Oracles for Distances Avoiding a Failed Node or Link. Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran. SIAM J. Comput. (37): 1299-1318 (2008). Web SearchBibTeXDownload
134Confident estimation for multistage measurement sampling and aggregation. Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup. SIGMETRICS 2008, 109-120. Cited by 1Web SearchBibTeXDownload
133Maximum overhang. Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick. SODA 2008, 756-765. Web SearchBibTeXDownload
132Minimum k-way cuts via deterministic greedy tree packing. Mikkel Thorup. STOC 2008, 159-166. Web SearchBibTeXDownload
2007
131Fully-Dynamic Min-Cut. Mikkel Thorup. Combinatorica (27): 91-127 (2007). Web SearchBibTeXDownload
130On the variance of subset sum estimation. Mario Szegedy, Mikkel Thorup. CoRR (abs/cs/0702029) (2007). Web SearchBibTeXDownload
129Compact Oracles for Approximate Distances Around Obstacles in the Plane. Mikkel Thorup. ESA 2007, 383-394. Web SearchBibTeXDownload
128On the Variance of Subset Sum Estimation. Mario Szegedy, Mikkel Thorup. ESA 2007, 75-86. Web SearchBibTeXDownload
127Planning for Fast Connectivity Updates. Mihai Patrascu, Mikkel Thorup. FOCS 2007, 263-271. Web SearchBibTeXDownload
126Algorithms and estimators for accurate summarization of internet traffic. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. Internet Measurement Comference 2007, 265-278. Cited by 8Web SearchBibTeXDownload
125Dynamic ordered sets with exponential search trees. Arne Andersson, Mikkel Thorup. J. ACM (54): 13 (2007). Web SearchBibTeXDownload
124Priority sampling for estimation of arbitrary subset sums. Nick G. Duffield, Carsten Lund, Mikkel Thorup. J. ACM (54) (2007). Cited by 11Web SearchBibTeXDownload
123Equivalence between priority queues and sorting. Mikkel Thorup. J. ACM (54) (2007). Web SearchBibTeXDownload
122Survivable IP network design with OSPF routing. Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup. Networks (49): 51-64 (2007). Web SearchBibTeXDownload
121Sketching unaggregated data streams for subpopulation-size queries. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PODS 2007, 253-262. Cited by 10Web SearchBibTeXDownload
120Randomization does not help searching predecessors. Mihai Patrascu, Mikkel Thorup. SODA 2007, 555-564. Web SearchBibTeXDownload
2006
119Melding priority queues. Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick. ACM Transactions on Algorithms (2): 535-556 (2006). Web SearchBibTeXDownload
118Time-Space Trade-Offs for Predecessor Search. Mihai Patrascu, Mikkel Thorup. CoRR (abs/cs/0603043) (2006). Web SearchBibTeXDownload
117Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?. Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup. ESA 2006, 732-743. Web SearchBibTeXDownload
116Higher Lower Bounds for Near-Neighbor and Further Rich Problems. Mihai Patrascu, Mikkel Thorup. FOCS 2006, 646-654. Web SearchBibTeXDownload
115Confidence intervals for priority sampling. Mikkel Thorup. SIGMETRICS/Performance 2006, 252-263. Web SearchBibTeXDownload
114Spanners and emulators with sublinear distance errors. Mikkel Thorup, Uri Zwick. SODA 2006, 802-809. Web SearchBibTeXDownload
113Time-space trade-offs for predecessor search. Mihai Patrascu, Mikkel Thorup. STOC 2006, 232-240. Web SearchBibTeXDownload
2005
112Maintaining information in fully dynamic trees with top trees. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. ACM Transactions on Algorithms (1): 243-264 (2005). Web SearchBibTeXDownload
111Black box for constant-time insertion in priority queues (note). Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup. ACM Transactions on Algorithms (1): 102-106 (2005). Web SearchBibTeXDownload
110Sampling to estimate arbitrary subset sums. Nick G. Duffield, Carsten Lund, Mikkel Thorup. CoRR (abs/cs/0509026) (2005). Cited by 6Web SearchBibTeXDownload
109Deterministic Constructions of Approximate Distance Oracles and Spanners. Liam Roditty, Mikkel Thorup, Uri Zwick. ICALP 2005, 261-272. Web SearchBibTeXDownload
108Union-Find with Constant Time Deletions. Stephen Alstrup, Inge Li Gĝrtz, Theis Rauhe, Mikkel Thorup, Uri Zwick. ICALP 2005, 78-89. Web SearchBibTeXDownload
107Estimating flow distributions from sampled flow statistics. Nick G. Duffield, Carsten Lund, Mikkel Thorup. IEEE/ACM Trans. Netw. (13): 933-946 (2005). Cited by 200Web SearchBibTeXDownload
106Learn more, sample less: control of volume and variance in network measurement. Nick G. Duffield, Carsten Lund, Mikkel Thorup. IEEE Transactions on Information Theory (51): 1756-1775 (2005). Cited by 86Web SearchBibTeXDownload
105Optimal Combination of Sampled Network Measurements. Nick G. Duffield, Carsten Lund, Mikkel Thorup. Internet Measurment Conference 2005, 91-104. Cited by 14Web SearchBibTeXDownload
104Approximate distance oracles. Mikkel Thorup, Uri Zwick. J. ACM (52): 1-24 (2005). Web SearchBibTeXDownload
103A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup. Networks (46): 36-56 (2005). Web SearchBibTeXDownload
102Estimating arbitrary subset sums with few probes. Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup. PODS 2005, 317-325. Cited by 20Web SearchBibTeXDownload
101Worst-case update times for fully-dynamic all-pairs shortest paths. Mikkel Thorup. STOC 2005, 112-119. Web SearchBibTeXDownload
2004
100Increasing Internet Capacity Using Local Search. Bernard Fortz, Mikkel Thorup. Comp. Opt. and Appl. (29): 13-48 (2004). Web SearchBibTeXDownload
99On Adaptive Integer Sorting. Anna Pagh, Rasmus Pagh, Mikkel Thorup. ESA 2004, 556-579. Web SearchBibTeXDownload
98Compact oracles for reachability and approximate distances in planar digraphs. Mikkel Thorup. J. ACM (51): 993-1024 (2004). Web SearchBibTeXDownload
97Integer priority queues with decrease key in constant time and the single source shortest paths problem. Mikkel Thorup. J. Comput. Syst. Sci. (69): 330-353 (2004). Web SearchBibTeXDownload
96Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. Math. Oper. Res. (29): 436-461 (2004). Web SearchBibTeXDownload
95Quick k-Median, k-Center, and Facility Location for Sparse Graphs. Mikkel Thorup. SIAM J. Comput. (34): 405-432 (2004). Web SearchBibTeXDownload
94OPT Versus LOAD in Dynamic Storage Allocation. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup. SIAM J. Comput. (33): 632-646 (2004). Web SearchBibTeXDownload
93Flow sampling under hard resource constraints. Nick G. Duffield, Carsten Lund, Mikkel Thorup. SIGMETRICS 2004, 85-96. Cited by 68Web SearchBibTeXDownload
92Meldable RAM priority queues and minimum directed spanning trees. Ran Mendelson, Mikkel Thorup, Uri Zwick. SODA 2004, 40-48. Web SearchBibTeXDownload
91Tabulation based 4-universal hashing with applications to second moment estimation. Mikkel Thorup, Yin Zhang. SODA 2004, 615-624. Web SearchBibTeXDownload
90Compact name-independent routing with minimum stretch. Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. SPAA 2004, 20-24. Web SearchBibTeXDownload
89Melding Priority Queues. Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick. SWAT 2004, 223-235. Web SearchBibTeXDownload
88Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. Mikkel Thorup. SWAT 2004, 384-396. Web SearchBibTeXDownload
2003
87Maintaining Information in Fully-Dynamic Trees with Top Trees. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. CoRR (cs.DS/0310065) (2003). Web SearchBibTeXDownload
86Load optimal MPLS routing with N+M labels. David Applegate, Mikkel Thorup. INFOCOM 2003. Web SearchBibTeXDownload
85Traffic engineering with estimated traffic matrices. Matthew Roughan, Mikkel Thorup, Yin Zhang. Internet Measurement Comference 2003, 248-258. Web SearchBibTeXDownload
84Combinatorial power in multimedia processors. Mikkel Thorup. SIGARCH Computer Architecture News (31): 5-11 (2003). Web SearchBibTeXDownload
83Estimating flow distributions from sampled flow statistics. Nick G. Duffield, Carsten Lund, Mikkel Thorup. SIGCOMM 2003, 325-336. Cited by 200Web SearchBibTeXDownload
82Performance of estimated traffic matrices in traffic engineering. Matthew Roughan, Mikkel Thorup, Yin Zhang. SIGMETRICS 2003, 326-327. Web SearchBibTeXDownload
81On AC0 implementations of fusion trees and atomic heaps. Mikkel Thorup. SODA 2003, 699-707. Web SearchBibTeXDownload
80Quick and good facility location. Mikkel Thorup. SODA 2003, 178-185. Web SearchBibTeXDownload
79Untangling the balancing and searching of balanced binary search trees. Matthew H. Austern, Bjarne Stroustrup, Mikkel Thorup, John Wilkinson. Softw., Pract. Exper. (33): 1273-1298 (2003). Web SearchBibTeXDownload
78Tree based MPLS routing. Anupam Gupta, Amit Kumar, Mikkel Thorup. SPAA 2003, 193-199. Web SearchBibTeXDownload
77Integer priority queues with decrease key in constant time and the single source shortest paths problem. Mikkel Thorup. STOC 2003, 149-158. Web SearchBibTeXDownload
76OPT versus LOAD in dynamic storage allocation. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup. STOC 2003, 556-564. Web SearchBibTeXDownload
75Space efficient dynamic stabbing with fast queries. Mikkel Thorup. STOC 2003, 649-658. Web SearchBibTeXDownload
2002
74Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. CoRR (cs.DS/0205051) (2002). Web SearchBibTeXDownload
73Dynamic Ordered Sets with Exponential Search Trees. Arne Andersson, Mikkel Thorup. CoRR (cs.DS/0210006) (2002). Web SearchBibTeXDownload
72Efficient Tree Layout in a Multilevel Memory Hierarchy. Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup. CoRR (cs.DS/0211010) (2002). Web SearchBibTeXDownload
71On Distance Oracles and Routing in Graphs. Mikkel Thorup. ESA 2002, 4. Web SearchBibTeXDownload
70Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. Yijie Han, Mikkel Thorup. FOCS 2002, 135-144. Web SearchBibTeXDownload
69Equivalence between Priority Queues and Sorting. Mikkel Thorup. FOCS 2002, 125-134. Web SearchBibTeXDownload
68Properties and prediction of flow statistics from sampled packet streams. Nick G. Duffield, Carsten Lund, Mikkel Thorup. Internet Measurement Workshop 2002, 159-171. Cited by 160Web SearchBibTeXDownload
67Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. Mikkel Thorup. J. Algorithms (42): 205-230 (2002). Web SearchBibTeXDownload
66Roundtrip spanners and roundtrip routing in directed graphs. Liam Roditty, Mikkel Thorup, Uri Zwick. SODA 2002, 844-851. Web SearchBibTeXDownload
65Oracles for distances avoiding a link-failure. Camil Demetrescu, Mikkel Thorup. SODA 2002, 838-843. Web SearchBibTeXDownload
2001
64An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup. ACM Journal of Experimental Algorithmics (6): 4 (2001). Web SearchBibTeXDownload
63A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. Valerie King, Mikkel Thorup. COCOON 2001, 268-277. Web SearchBibTeXDownload
62Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. Mikkel Thorup. FOCS 2001, 242-251. Web SearchBibTeXDownload
61Quick k-Median, k-Center, and Facility Location for Sparse Graphs. Mikkel Thorup. ICALP 2001, 249-260. Web SearchBibTeXDownload
60Charging from sampled network usage. Nick G. Duffield, Carsten Lund, Mikkel Thorup. Internet Measurement Workshop 2001, 245-256. Cited by 153Web SearchBibTeXDownload
59Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. J. ACM (48): 723-760 (2001). Web SearchBibTeXDownload
58Dynamic string searching. Arne Andersson, Mikkel Thorup. SODA 2001, 307-308. Web SearchBibTeXDownload
57Compact routing schemes. Mikkel Thorup, Uri Zwick. SPAA 2001, 1-10. Web SearchBibTeXDownload
56Approximate distance oracles. Mikkel Thorup, Uri Zwick. STOC 2001, 183-192. Web SearchBibTeXDownload
55Fully-dynamic min-cut. Mikkel Thorup. STOC 2001, 224-230. Web SearchBibTeXDownload
2000
54Generalized Dominators for Structured Programs. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup. Algorithmica (27): 244-253 (2000). Web SearchBibTeXDownload
53Internet Traffic Engineering by Optimizing OSPF Weights. Bernard Fortz, Mikkel Thorup. INFOCOM 2000, 519-528. Web SearchBibTeXDownload
52Floats, Integers, and Single Source Shortest Paths. Mikkel Thorup. J. Algorithms (35): 189-201 (2000). Web SearchBibTeXDownload
51Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Stephen Alstrup, Mikkel Thorup. J. Algorithms (35): 169-188 (2000). Web SearchBibTeXDownload
50On RAM Priority Queues. Mikkel Thorup. SIAM J. Comput. (30): 86-109 (2000). Web SearchBibTeXDownload
49An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup. SIAM J. Comput. (30): 1385-1404 (2000). Web SearchBibTeXDownload
48Even strongly universal hashing is pretty fast. Mikkel Thorup. SODA 2000, 496-497. Web SearchBibTeXDownload
47Word encoding tree connectivity works. Stephen Alstrup, Jens P. Secher, Mikkel Thorup. SODA 2000, 498-499. Web SearchBibTeXDownload
46Near-optimal fully-dynamic graph connectivity. Mikkel Thorup. STOC 2000, 343-350. Web SearchBibTeXDownload
45Tight(er) worst-case bounds on dynamic searching and priority queues. Arne Andersson, Mikkel Thorup. STOC 2000, 335-342. Web SearchBibTeXDownload
44Maintaining Center and Median in Dynamic Trees. Stephen Alstrup, Jacob Holm, Mikkel Thorup. SWAT 2000, 46-56. Web SearchBibTeXDownload
43Dynamic Graph Algorithms with Applications. Mikkel Thorup. SWAT 2000, 1-9. Web SearchBibTeXDownload
1999
42Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. Mikkel Thorup. J. ACM (46): 362-394 (1999). Web SearchBibTeXDownload
41Decremental Dynamic Connectivity. Mikkel Thorup. J. Algorithms (33): 229-243 (1999). Web SearchBibTeXDownload
40Dominators in Linear Time. Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup. SIAM J. Comput. (28): 2117-2132 (1999). Web SearchBibTeXDownload
39On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup, Mikkel Thorup. SIAM J. Comput. (28): 1073-1085 (1999). Web SearchBibTeXDownload
38Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. STOC 1999, 668-678. Web SearchBibTeXDownload
37Fusion Trees can be Implemented with AC0 Instructions Only. Arne Andersson, Peter Bro Miltersen, Mikkel Thorup. Theor. Comput. Sci. (215): 337-344 (1999). Web SearchBibTeXDownload
1998
36String Matching in Lempel-Ziv Compressed Strings. Martin Farach, Mikkel Thorup. Algorithmica (20): 388-404 (1998). Web SearchBibTeXDownload
35Map Graphs in Polynomial Time. Mikkel Thorup. FOCS 1998, 396-405. Web SearchBibTeXDownload
34All Structured Programs have Small Tree-Width and Good Register Allocation. Mikkel Thorup. Inf. Comput. (142): 159-181 (1998). Web SearchBibTeXDownload
33Direct Routing on Trees (Extended Abstract). Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. SODA 1998, 342-349. Web SearchBibTeXDownload
32Faster Deterministic Sorting and Priority Queues in Linear Space. Mikkel Thorup. SODA 1998, 550-555. Web SearchBibTeXDownload
31Floats, Integers, and Single Source Shortest Paths. Mikkel Thorup. STACS 1998, 14-24. Web SearchBibTeXDownload
30Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. STOC 1998, 79-89. Web SearchBibTeXDownload
1997
29Undirected Single Source Shortest Path in Linear Time. Mikkel Thorup. FOCS 1997, 12-21. Web SearchBibTeXDownload
28Minimizing Diameters of Dynamic Trees. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. ICALP 1997, 270-280. Web SearchBibTeXDownload
27Parallel Shortcutting of Rooted Trees. Mikkel Thorup. J. Algorithms (23): 139-159 (1997). Web SearchBibTeXDownload
26Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Monika Rauch Henzinger, Mikkel Thorup. Random Struct. Algorithms (11): 369-379 (1997). Cited by 17Web SearchBibTeXDownload
25Sparse Dynamic Programming for Evolutionary-Tree Comparison. Martin Farach, Mikkel Thorup. SIAM J. Comput. (26): 210-230 (1997). Web SearchBibTeXDownload
24Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. Mikkel Thorup. SODA 1997, 352-359. Web SearchBibTeXDownload
23Decremental Dynamic Connectivity. Mikkel Thorup. SODA 1997, 305-313. Web SearchBibTeXDownload
22Finding Cores of Limited Length. Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup. WADS 1997, 45-54. Web SearchBibTeXDownload
21Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). Mikkel Thorup. WG 1997, 318-332. Web SearchBibTeXDownload
1996
20Disambiguating Grammars by Exclusion of Sub-Parse Trees. Mikkel Thorup. Acta Inf. (33): 511-522 (1996). Web SearchBibTeXDownload
19Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. Arne Andersson, Peter Bro Miltersen, Sĝren Riis, Mikkel Thorup. FOCS 1996, 441-450. Web SearchBibTeXDownload
18Improved Sampling with Applications to Dynamic Graph Algorithms. Monika Rauch Henzinger, Mikkel Thorup. ICALP 1996, 290-299. Cited by 19Web SearchBibTeXDownload
17Efficient Preprocessing of Simple Binay Pattern Forests. Mikkel Thorup. J. Algorithms (20): 602-612 (1996). Web SearchBibTeXDownload
16Generalized Dominators for Structured Programs. Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup. SAS 1996, 42-51. Web SearchBibTeXDownload
15On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup, Mikkel Thorup. SODA 1996, 365-372. Web SearchBibTeXDownload
14On RAM Priority Queues. Mikkel Thorup. SODA 1996, 59-67. Web SearchBibTeXDownload
13Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Stephen Alstrup, Mikkel Thorup. SWAT 1996, 212-222. Web SearchBibTeXDownload
1995
12Shortcutting Planar Digraphs. Mikkel Thorup. Combinatorics, Probability & Computing (4): 287-315 (1995). Web SearchBibTeXDownload
11Computing the Agreement of Trees with Bounded Degrees. Martin Farach, Teresa M. Przytycka, Mikkel Thorup. ESA 1995, 381-393. Web SearchBibTeXDownload
10Fast Comparison of Evolutionary Trees. Martin Farach, Mikkel Thorup. Inf. Comput. (123): 29-37 (1995). Web SearchBibTeXDownload
9On the Agreement of Many Trees. Martin Farach, Teresa M. Przytycka, Mikkel Thorup. Inf. Process. Lett. (55): 297-301 (1995). Web SearchBibTeXDownload
8String matching in Lempel-Ziv compressed strings. Martin Farach, Mikkel Thorup. STOC 1995, 703-712. Web SearchBibTeXDownload
1994
7Controlled Grammatic Ambiguity. Mikkel Thorup. ACM Trans. Program. Lang. Syst. (16): 1024-1050 (1994). Web SearchBibTeXDownload
6Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract). Martin Farach, Mikkel Thorup. FOCS 1994, 770-779. Web SearchBibTeXDownload
5Fast Comparison of Evolutionary Trees. Martin Farach, Mikkel Thorup. SODA 1994, 481-488. Web SearchBibTeXDownload
4Efficient Preprocessing of Simple Binary Pattern Forests. Mikkel Thorup. SWAT 1994, 350-358. Web SearchBibTeXDownload
1992
3On Shortcutting Digraphs. Mikkel Thorup. WG 1992, 205-211. Web SearchBibTeXDownload
1991
2On Conservative Extensions of Syntax in System Development. Andrzej Blikle, Andrzej Tarlecki, Mikkel Thorup. Theor. Comput. Sci. (90): 209-233 (1991). Web SearchBibTeXDownload
1990
1On Conservative Extensions of Syntax in the Process of System Development. Andrzej Blikle, Mikkel Thorup. VDM Europe 1990, 504-525. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research