| 2026 | ICALP | Static to Dynamic Correlation Clustering. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang |
| 2026 | SODA | PageRank Centrality in Directed Graphs with Bounded In-Degree. | Mikkel Thorup, Hanzhi Wang, Zhewei Wei, Mingji Yang |
| 2025 | ICALP | Faster All-Pairs Optimal Electric Car Routing. | Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick |
| 2025 | ISAAC | Hash Functions Bridging the Gap from Theory to Practice (Invited Talk). | Mikkel Thorup |
| 2025 | STOC | Solving the Correlation Cluster LP in Sublinear Time. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang |
| 2025 | STACS | A Faster Algorithm for Constrained Correlation Clustering. | Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup |
| 2024 | FOCS | Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. | Shyam Narayanan, Vclav Rozhon, Jakub Tetek, Mikkel Thorup |
| 2024 | SODA | Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. | Wenyu Jin, Xiaorui Sun, Mikkel Thorup |
| 2024 | STOC | Combinatorial Correlation Clustering. | Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang |
| 2024 | STOC | Better Coloring of 3-Colorable Graphs. | Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda |
| 2023 | FOCS | Locally Uniform Hashing. | Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bk Tejs Houen, Mikkel Thorup |
| 2023 | FOCS | Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. | Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff |
| 2023 | ICALP | Optimal Decremental Connectivity in Non-Sparse Graphs. | Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
| 2023 | ICALP | A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing. | Jakob Bk Tejs Houen, Mikkel Thorup |
| 2023 | SODA | Fully Dynamic Exact Edge Connectivity in Sublinear Time. | Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen |
| 2022 | ICALP | Understanding the Moments of Tabulation Hashing via Chaoses. | Jakob Bk Tejs Houen, Mikkel Thorup |
| 2022 | STOC | Edge sampling and graph parameter estimation via vertex neighborhood accesses. | Jakub Tetek, Mikkel Thorup |
| 2021 | FOCS | Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. | Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup |
| 2021 | STOC | Load balancing with dynamic set of balls and bins. | Anders Aamand, Jakob Bk Tejs Knudsen, Mikkel Thorup |
| 2020 | SODA | Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. | Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup |
| 2020 | STOC | Fast hashing with strong concentration bounds. | Anders Aamand, Jakob Bk Tejs Knudsen, Mathias Bk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup |
| 2020 | STOC | Three-in-a-tree in near linear time. | Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup |
| 2020 | SISAP | Confirmation Sampling for Exact Nearest Neighbor Search. | Tobias Christiani, Rasmus Pagh, Mikkel Thorup |
| 2019 | ESA | Hardness of Bichromatic Closest Pair with Jaccard Similarity. | Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup |
| 2019 | FOCS | Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. | Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2019 | ICALP | Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. | Mikkel Thorup, Or Zamir, Uri Zwick |
| 2019 | SODA | Non-empty Bins with Simple Tabulation Hashing. | Anders Aamand, Mikkel Thorup |
| 2018 | ICALP | Power of d Choices with Simple Tabulation. | Anders Aamand, Mathias Bk Tejs Knudsen, Mikkel Thorup |
| 2018 | MOBIHOC | Wireless coverage prediction via parametric shortest paths. | David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang |
| 2018 | SODA | Dynamic Bridge-Finding in | Jacob Holm, Eva Rotenberg, Mikkel Thorup |
| 2018 | SODA | The Entropy of Backwards Analysis. | Mathias Bk Tejs Knudsen, Mikkel Thorup |
| 2018 | SODA | Consistent Hashing with Bounded Loads. | Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam |
| 2018 | STOC | Fast fencing. | Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup |
| 2017 | FOCS | Fast Similarity Sketching. | Sren Dahlgaard, Mathias Bk Tejs Knudsen, Mikkel Thorup |
| 2017 | FOGA | Fast and Powerful Hashing using Tabulation. | Mikkel Thorup |
| 2017 | ICALP | Fast and Powerful Hashing Using Tabulation (Invited Talk). | Mikkel Thorup |
| 2016 | ESA | Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. | Gramoz Goranci, Monika Henzinger, Mikkel Thorup |
| 2016 | ESA | Faster Worst Case Deterministic Dynamic Connectivity. | Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup |
| 2016 | FOCS | Heavy Hitters via Cluster-Preserving Clustering. | Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup |
| 2016 | SODA | The Power of Two Choices with Simple Tabulation. | Sren Dahlgaard, Mathias Bk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup |
| 2016 | STACS | Bottleneck Paths and Trees and Deterministic Graphical Games. | Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2015 | FOCS | Hashing for Statistics over K-Partitions. | Sren Dahlgaard, Mathias Bk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup |
| 2015 | FOCS | Planar Reachability in Linear Space and Constant Time. | Jacob Holm, Eva Rotenberg, Mikkel Thorup |
| 2015 | FOCS | Sample (x) = (a*x<=t) is a Distinguisher with Probability 1/8. | Mikkel Thorup |
| 2015 | PODC | Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication. | Valerie King, Shay Kutten, Mikkel Thorup |
| 2015 | STOC | Adjacency Labeling Schemes and Induced-Universal Graphs. | Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick |
| 2015 | STOC | From Independence to Expansion and Back Again. | Tobias Christiani, Rasmus Pagh, Mikkel Thorup |
| 2015 | STOC | Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2014 | FOCS | Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. | Mihai Patrascu, Mikkel Thorup |
| 2014 | STACS | Coloring 3-colorable graphs with o(n^{1/5}) colors. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2013 | FOCS | Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. | Mikkel Thorup |
| 2013 | ISAAC | RAM-Efficient External Memory Sorting. | Lars Arge, Mikkel Thorup |
| 2013 | SODA | More Compact Oracles for Approximate Distances in Undirected Planar Graphs. | Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup |
| 2013 | SODA | Twisted Tabulation Hashing. | Mihai Patrascu, Mikkel Thorup |
| 2013 | STOC | Bottom-k and priority sampling, set similarity and subset sums with minimal independence. | Mikkel Thorup |
| 2012 | FOCS | Combinatorial Coloring of 3-Colorable Graphs. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2012 | FOCS | A New Infinity of Distance Oracles for Sparse Graphs. | Mihai Patrascu, Liam Roditty, Mikkel Thorup |
| 2011 | FOCS | The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. | Ken-ichi Kawarabayashi, Mikkel Thorup |
| 2011 | INFOCOM | Timeouts with time-reversed linear probing. | Mikkel Thorup |
| 2011 | STOC | The power of simple tabulation hashing. | Mihai Patrascu, Mikkel Thorup |
| 2011 | STOC | Don't rush into a union: take time to find your roots. | Mihai Patrascu, Mikkel Thorup |
| 2010 | ALENEX | Tabulation Based 5-Universal Hashing and Linear Probing. | Mikkel Thorup, Yin Zhang |
| 2010 | ICALP | On the | Mihai Patrascu, Mikkel Thorup |
| 2010 | SODA | Regular Expression Matching with Multi-Strings and Intervals. | Philip Bille, Mikkel Thorup |
| 2010 | STOC | Changing base without losing space. | Yevgeniy Dodis, Mihai Patrascu, Mikkel Thorup |
| 2009 | ICALP | Faster Regular Expression Matching. | Philip Bille, Mikkel Thorup |
| 2009 | SODA | Stream sampling for variance-optimal estimation of subset sums. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2009 | SODA | Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. | Omid Madani, Mikkel Thorup, Uri Zwick |
| 2009 | SODA | String hashing for linear probing. | Mikkel Thorup |
| 2008 | SODA | Maximum overhang. | Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick |
| 2008 | STOC | Minimum k-way cuts via deterministic greedy tree packing. | Mikkel Thorup |
| 2008 | SIGMETRICS | Confident estimation for multistage measurement sampling and aggregation. | Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2007 | ESA | On the Variance of Subset Sum Estimation. | Mario Szegedy, Mikkel Thorup |
| 2007 | ESA | Compact Oracles for Approximate Distances Around Obstacles in the Plane. | Mikkel Thorup |
| 2007 | FOCS | Planning for Fast Connectivity Updates. | Mihai Patrascu, Mikkel Thorup |
| 2007 | IMC | Algorithms and estimators for accurate summarization of internet traffic. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2007 | PODS | Sketching unaggregated data streams for subpopulation-size queries. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2007 | SODA | Randomization does not help searching predecessors. | Mihai Patrascu, Mikkel Thorup |
| 2006 | ESA | Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? | Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup |
| 2006 | FOCS | Higher Lower Bounds for Near-Neighbor and Further Rich Problems. | Mihai Patrascu, Mikkel Thorup |
| 2006 | SODA | Spanners and emulators with sublinear distance errors. | Mikkel Thorup, Uri Zwick |
| 2006 | STOC | Time-space trade-offs for predecessor search. | Mihai Patrascu, Mikkel Thorup |
| 2006 | SIGMETRICS | Confidence intervals for priority sampling. | Mikkel Thorup |
| 2005 | ICALP | Union-Find with Constant Time Deletions. | Stephen Alstrup, Inge Li Grtz, Theis Rauhe, Mikkel Thorup, Uri Zwick |
| 2005 | ICALP | Deterministic Constructions of Approximate Distance Oracles and Spanners. | Liam Roditty, Mikkel Thorup, Uri Zwick |
| 2005 | IMC | Optimal Combination of Sampled Network Measurements. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2005 | PODS | Estimating arbitrary subset sums with few probes. | Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2005 | STOC | Worst-case update times for fully-dynamic all-pairs shortest paths. | Mikkel Thorup |
| 2004 | ESA | On Adaptive Integer Sorting. | Anna Pagh, Rasmus Pagh, Mikkel Thorup |
| 2004 | SODA | Meldable RAM priority queues and minimum directed spanning trees. | Ran Mendelson, Mikkel Thorup, Uri Zwick |
| 2004 | SODA | Tabulation based 4-universal hashing with applications to second moment estimation. | Mikkel Thorup, Yin Zhang |
| 2004 | SIGMETRICS | Flow sampling under hard resource constraints. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2004 | SPAA | Compact name-independent routing with minimum stretch. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup |
| 2003 | IMC | Traffic engineering with estimated traffic matrices. | Matthew Roughan, Mikkel Thorup, Yin Zhang |
| 2003 | INFOCOM | Load optimal MPLS routing with N+M labels. | David L. Applegate, Mikkel Thorup |
| 2003 | SODA | Quick and good facility location. | Mikkel Thorup |
| 2003 | SODA | On AC | Mikkel Thorup |
| 2003 | STOC | OPT versus LOAD in dynamic storage allocation. | Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup |
| 2003 | STOC | Integer priority queues with decrease key in constant time and the single source shortest paths problem. | Mikkel Thorup |
| 2003 | STOC | Space efficient dynamic stabbing with fast queries. | Mikkel Thorup |
| 2003 | SIGCOMM | Estimating flow distributions from sampled flow statistics. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2003 | SIGMETRICS | Performance of estimated traffic matrices in traffic engineering. | Matthew Roughan, Mikkel Thorup, Yin Zhang |
| 2003 | SPAA | Tree based MPLS routing. | Anupam Gupta, Amit Kumar, Mikkel Thorup |
| 2002 | ESA | On Distance Oracles and Routing in Graphs. | Mikkel Thorup |
| 2002 | FOCS | Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. | Yijie Han, Mikkel Thorup |
| 2002 | FOCS | Equivalence between Priority Queues and Sorting. | Mikkel Thorup |
| 2002 | IMC | Properties and prediction of flow statistics from sampled packet streams. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2002 | SODA | Oracles for distances avoiding a link-failure. | Camil Demetrescu, Mikkel Thorup |
| 2002 | SODA | Roundtrip spanners and roundtrip routing in directed graphs. | Liam Roditty, Mikkel Thorup, Uri Zwick |
| 2001 | COCOON | A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. | Valerie King, Mikkel Thorup |
| 2001 | FOCS | Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. | Mikkel Thorup |
| 2001 | ICALP | Quick k-Median, k-Center, and Facility Location for Sparse Graphs. | Mikkel Thorup |
| 2001 | SODA | Dynamic string searching. | Arne Andersson, Mikkel Thorup |
| 2001 | STOC | Fully-dynamic min-cut. | Mikkel Thorup |
| 2001 | STOC | Approximate distance oracles. | Mikkel Thorup, Uri Zwick |
| 2001 | SPAA | Compact routing schemes. | Mikkel Thorup, Uri Zwick |
| 2000 | INFOCOM | Internet Traffic Engineering by Optimizing OSPF Weights. | Bernard Fortz, Mikkel Thorup |
| 2000 | SODA | Word encoding tree connectivity works. | Stephen Alstrup, Jens P. Secher, Mikkel Thorup |
| 2000 | SODA | Even strongly universal hashing is pretty fast. | Mikkel Thorup |
| 2000 | STOC | Tight(er) worst-case bounds on dynamic searching and priority queues. | Arne Andersson, Mikkel Thorup |
| 2000 | STOC | Near-optimal fully-dynamic graph connectivity. | Mikkel Thorup |
| 1999 | STOC | Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. | David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young |
| 1998 | FOCS | Map Graphs in Polynomial Time. | Mikkel Thorup |
| 1998 | SODA | Direct Routing on Trees (Extended Abstract). | Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup |
| 1998 | SODA | Faster Deterministic Sorting and Priority Queues in Linear Space. | Mikkel Thorup |
| 1998 | STOC | Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. | Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup |
| 1998 | STACS | Floats, Integers, and Single Source Shortest Paths. | Mikkel Thorup |
| 1997 | FOCS | Undirected Single Source Shortest Path in Linear Time. | Mikkel Thorup |
| 1997 | ICALP | Minimizing Diameters of Dynamic Trees. | Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup |
| 1997 | SODA | Decremental Dynamic Connectivity. | Mikkel Thorup |
| 1997 | SODA | Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. | Mikkel Thorup |
| 1997 | WADS | Finding Cores of Limited Length. | Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup |
| 1997 | WG | Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). | Mikkel Thorup |
| 1996 | FOCS | Static Dictionaries on AC | Arne Andersson, Peter Bro Miltersen, Sren Riis, Mikkel Thorup |
| 1996 | ICALP | Improved Sampling with Applications to Dynamic Graph Algorithms. | Monika Rauch Henzinger, Mikkel Thorup |
| 1996 | SODA | On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). | Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup |
| 1996 | SODA | On RAM Priority Queues. | Mikkel Thorup |
| 1996 | SAS | Generalized Dominators for Structured Programs. | Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup |
| 1995 | ESA | Computing the Agreement of Trees with Bounded Degrees. | Martin Farach, Teresa M. Przytycka, Mikkel Thorup |
| 1995 | STOC | String matching in Lempel-Ziv compressed strings. | Martin Farach, Mikkel Thorup |
| 1994 | FOCS | Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) | Martin Farach, Mikkel Thorup |
| 1994 | SODA | Fast Comparison of Evolutionary Trees. | Martin Farach, Mikkel Thorup |
| 1992 | WG | On Shortcutting Digraphs. | Mikkel Thorup |
| 1990 | FM | On Conservative Extensions of Syntax in the Process of System Development. | Andrzej Blikle, Mikkel Thorup |