On Conservative Extensions of Syntax in the Process of System Development. - Andrzej Blikle; Mikkel Thorup (VDM Europe, 1990)

On Conservative Extensions of Syntax in System Development. - Andrzej Blikle; Andrzej Tarlecki; Mikkel Thorup (Theor. Comput. Sci., 1991)

On Shortcutting Digraphs. - Mikkel Thorup (WG, 1992)

Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) - Martin Farach; Mikkel Thorup (FOCS, 1994)

Efficient Preprocessing of Simple Binary Pattern Forests. - Mikkel Thorup (SWAT, 1994)

Controlled Grammatic Ambiguity. - Mikkel Thorup (ACM Trans. Program. Lang. Syst., 1994)

Computing the Agreement of Trees with Bounded Degrees. - Martin Farach; Teresa M. Przytycka; Mikkel Thorup (ESA, 1995)

Shortcutting Planar Digraphs. - Mikkel Thorup (Comb. Probab. Comput., 1995)

Fast Comparison of Evolutionary Trees. - Martin Farach; Mikkel Thorup (Inf. Comput., 1995)

On the Agreement of Many Trees. - Martin Farach; Teresa M. Przytycka; Mikkel Thorup (Inf. Process. Lett., 1995)

Static 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)

Improved Sampling with Applications to Dynamic Graph Algorithms. - Monika Rauch Henzinger; Mikkel Thorup (ICALP, 1996)

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). - Richa Agarwala; Vineet Bafna; Martin Farach; Babu O. Narayanan; Mike Paterson; Mikkel Thorup (SODA, 1996)

Disambiguating Grammars by Exclusion of Sub-Parse Trees. - Mikkel Thorup (Acta Informatica, 1996)

Efficient Preprocessing of Simple Binay Pattern Forests. - Mikkel Thorup (J. Algorithms, 1996)

Undirected Single Source Shortest Path in Linear Time. - Mikkel Thorup (FOCS, 1997)

Minimizing Diameters of Dynamic Trees. - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (ICALP, 1997)

Finding Cores of Limited Length. - Stephen Alstrup; Peter W. Lauridsen; Peer Sommerlund; Mikkel Thorup (WADS, 1997)

Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). - Mikkel Thorup (WG, 1997)

Parallel Shortcutting of Rooted Trees. - Mikkel Thorup (J. Algorithms, 1997)

Sampling to provide or to bound: With applications to fully dynamic graph algorithms. - Monika Rauch Henzinger; Mikkel Thorup (Random Struct. Algorithms, 1997)

Sparse Dynamic Programming for Evolutionary-Tree Comparison. - Martin Farach; Mikkel Thorup (SIAM J. Comput., 1997)

Map Graphs in Polynomial Time. - Mikkel Thorup (FOCS, 1998)

Direct Routing on Trees (Extended Abstract). - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (SODA, 1998)

Faster Deterministic Sorting and Priority Queues in Linear Space. - Mikkel Thorup (SODA, 1998)

String Matching in Lempel-Ziv Compressed Strings. - Martin Farach; Mikkel Thorup (Algorithmica, 1998)

All Structured Programs have Small Tree-Width and Good Register Allocation. - Mikkel Thorup (Inf. Comput., 1998)

Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. - Mikkel Thorup (J. ACM, 1999)

Decremental Dynamic Connectivity. - Mikkel Thorup (J. Algorithms, 1999)

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). - Richa Agarwala; Vineet Bafna; Martin Farach; Mike Paterson; Mikkel Thorup (SIAM J. Comput., 1999)

Dominators in Linear Time. - Stephen Alstrup; Dov Harel; Peter W. Lauridsen; Mikkel Thorup (SIAM J. Comput., 1999)

Fusion Trees can be Implemented with AC0 Instructions Only. - Arne Andersson; Peter Bro Miltersen; Mikkel Thorup (Theor. Comput. Sci., 1999)

Internet Traffic Engineering by Optimizing OSPF Weights. - Bernard Fortz; Mikkel Thorup (INFOCOM, 2000)

Word encoding tree connectivity works. - Stephen Alstrup; Jens P. Secher; Mikkel Thorup (SODA, 2000)

Even strongly universal hashing is pretty fast. - Mikkel Thorup (SODA, 2000)

Tight(er) worst-case bounds on dynamic searching and priority queues. - Arne Andersson; Mikkel Thorup (STOC, 2000)

Near-optimal fully-dynamic graph connectivity. - Mikkel Thorup (STOC, 2000)

Maintaining Center and Median in Dynamic Trees. - Stephen Alstrup; Jacob Holm; Mikkel Thorup (SWAT, 2000)

Dynamic Graph Algorithms with Applications. - Mikkel Thorup; David R. Karger (SWAT, 2000)

Generalized Dominators for Structured Programs. - Stephen Alstrup; Peter W. Lauridsen; Mikkel Thorup (Algorithmica, 2000)

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. - Stephen Alstrup; Mikkel Thorup (J. Algorithms, 2000)

Floats, Integers, and Single Source Shortest Paths. - Mikkel Thorup (J. Algorithms, 2000)

An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. - Richard Cole 001; Martin Farach-Colton; Ramesh Hariharan; Teresa M. Przytycka; Mikkel Thorup (SIAM J. Comput., 2000)

On RAM Priority Queues. - Mikkel Thorup (SIAM J. Comput., 2000)

A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. - Valerie King; Mikkel Thorup (COCOON, 2001)

Charging from sampled network usage. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (Internet Measurement Workshop, 2001)

Dynamic string searching. - Arne Andersson; Mikkel Thorup (SODA, 2001)

Compact routing schemes. - Mikkel Thorup; Uri Zwick (SPAA, 2001)

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. - Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (J. ACM, 2001)

An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. - Raj Iyer; David R. Karger; Hariharan Rahul; Mikkel Thorup (ACM J. Exp. Algorithmics, 2001)

On Distance Oracles and Routing in Graphs. - Mikkel Thorup (ESA, 2002)

Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. - Yijie Han; Mikkel Thorup (FOCS, 2002)

Properties and prediction of flow statistics from sampled packet streams. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (Internet Measurement Workshop, 2002)

Oracles for distances avoiding a link-failure. - Camil Demetrescu; Mikkel Thorup (SODA, 2002)

Traffic engineering with traditional IP routing protocols. - Bernard Fortz; Jennifer Rexford; Mikkel Thorup (IEEE Commun. Mag., 2002)

Efficient 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, 2002)

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. - Mikkel Thorup (J. Algorithms, 2002)

Optimizing OSPF/IS-IS weights in a changing world. - Bernard Fortz; Mikkel Thorup (IEEE J. Sel. Areas Commun., 2002)

Traffic engineering with estimated traffic matrices. - Matthew Roughan; Mikkel Thorup; Yin Zhang 001 (Internet Measurement Conference, 2003)

Load optimal MPLS routing with N+M labels. - David L. Applegate; Mikkel Thorup (INFOCOM, 2003)

Performance of estimated traffic matrices in traffic engineering. - Matthew Roughan; Mikkel Thorup; Yin Zhang 001 (SIGMETRICS, 2003)

Quick and good facility location. - Mikkel Thorup (SODA, 2003)

On AC0 implementations of fusion trees and atomic heaps. - Mikkel Thorup (SODA, 2003)

Tree based MPLS routing. - Anupam Gupta 001; Amit Kumar 001; Mikkel Thorup (SPAA, 2003)

Space efficient dynamic stabbing with fast queries. - Mikkel Thorup (STOC, 2003)

Combinatorial power in multimedia processors. - Mikkel Thorup (SIGARCH Comput. Archit. News, 2003)

Untangling the balancing and searching of balanced binary search trees. - Matthew H. Austern; Bjarne Stroustrup; Mikkel Thorup; John Wilkinson (Softw. Pract. Exp., 2003)

On Adaptive Integer Sorting. - Anna Pagh; Rasmus Pagh; Mikkel Thorup (ESA, 2004)

Flow sampling under hard resource constraints. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (SIGMETRICS, 2004)

Meldable RAM priority queues and minimum directed spanning trees. - Ran Mendelson; Mikkel Thorup; Uri Zwick (SODA, 2004)

Tabulation based 4-universal hashing with applications to second moment estimation. - Mikkel Thorup; Yin Zhang 001 (SODA, 2004)

Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. - Mikkel Thorup (SWAT, 2004)

Increasing Internet Capacity Using Local Search. - Bernard Fortz; Mikkel Thorup (Comput. Optim. Appl., 2004)

Compact oracles for reachability and approximate distances in planar digraphs. - Mikkel Thorup (J. ACM, 2004)

Integer priority queues with decrease key in constant time and the single source shortest paths problem. - Mikkel Thorup (J. Comput. Syst. Sci., 2004)

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. - David R. Karger; Philip N. Klein; Clifford Stein 001; Mikkel Thorup; Neal E. Young (Math. Oper. Res., 2004)

OPT Versus LOAD in Dynamic Storage Allocation. - Adam L. Buchsbaum; Howard J. Karloff; Claire Kenyon; Nick Reingold; Mikkel Thorup (SIAM J. Comput., 2004)

Quick k-Median, k-Center, and Facility Location for Sparse Graphs. - Mikkel Thorup (SIAM J. Comput., 2004)

Deterministic Constructions of Approximate Distance Oracles and Spanners. - Liam Roditty; Mikkel Thorup; Uri Zwick (ICALP, 2005)

Optimal Combination of Sampled Network Measurements. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (Internet Measurement Conference, 2005)

Estimating arbitrary subset sums with few probes. - Noga Alon; Nick G. Duffield; Carsten Lund; Mikkel Thorup (PODS, 2005)

Worst-case update times for fully-dynamic all-pairs shortest paths. - Mikkel Thorup (STOC, 2005)

Sampling to estimate arbitrary subset sums - Nick G. Duffield; Carsten Lund; Mikkel Thorup (CoRR, 2005)

Approximate distance oracles. - Mikkel Thorup; Uri Zwick (J. ACM, 2005)

A 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, 2005)

Maintaining information in fully dynamic trees with top trees. - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (ACM Trans. Algorithms, 2005)

Black box for constant-time insertion in priority queues (note). - Stephen Alstrup; Thore Husfeldt; Theis Rauhe; Mikkel Thorup (ACM Trans. Algorithms, 2005)

Learn more, sample less: control of volume and variance in network measurement. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (IEEE Trans. Inf. Theory, 2005)

Estimating flow distributions from sampled flow statistics. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (IEEE/ACM Trans. Netw., 2005)

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? - Camil Demetrescu; Pompeo Faruolo; Giuseppe F. Italiano; Mikkel Thorup (ESA, 2006)

Confidence intervals for priority sampling. - Mikkel Thorup (SIGMETRICS/Performance, 2006)

Spanners and emulators with sublinear distance errors. - Mikkel Thorup; Uri Zwick (SODA, 2006)

Time-space trade-offs for predecessor search. - Mihai Patrascu; Mikkel Thorup (STOC, 2006)

Melding priority queues. - Ran Mendelson; Robert Endre Tarjan; Mikkel Thorup; Uri Zwick (ACM Trans. Algorithms, 2006)

On the Variance of Subset Sum Estimation. - Mario Szegedy; Mikkel Thorup (ESA, 2007)

Compact Oracles for Approximate Distances Around Obstacles in the Plane. - Mikkel Thorup (ESA, 2007)

Planning for Fast Connectivity Updates. - Mihai Patrascu; Mikkel Thorup (FOCS, 2007)

Algorithms and estimators for accurate summarization of internet traffic. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Internet Measurement Conference, 2007)

Sketching unaggregated data streams for subpopulation-size queries. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (PODS, 2007)

Randomization does not help searching predecessors. - Mihai Patrascu; Mikkel Thorup (SODA, 2007)

Fully-Dynamic Min-Cut. - Mikkel Thorup (Comb., 2007)

Dynamic ordered sets with exponential search trees. - Arne Andersson; Mikkel Thorup (J. ACM, 2007)

Priority sampling for estimation of arbitrary subset sums. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (J. ACM, 2007)

Equivalence between priority queues and sorting. - Mikkel Thorup (J. ACM, 2007)

Survivable IP network design with OSPF routing. - Luciana S. Buriol; Mauricio G. C. Resende; Mikkel Thorup (Networks, 2007)

Confident estimation for multistage measurement sampling and aggregation. - Edith Cohen; Nick G. Duffield; Carsten Lund; Mikkel Thorup (SIGMETRICS, 2008)

Minimum k-way cuts via deterministic greedy tree packing. - Mikkel Thorup (STOC, 2008)

Variance optimal sampling based estimation of subset sums - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (CoRR, 2008)

Speeding Up Dynamic Shortest-Path Algorithms. - Luciana S. Buriol; Mauricio G. C. Resende; Mikkel Thorup (INFORMS J. Comput., 2008)

Oracles for Distances Avoiding a Failed Node or Link. - Camil Demetrescu; Mikkel Thorup; Rezaul Alam Chowdhury; Vijaya Ramachandran (SIAM J. Comput., 2008)

Compact name-independent routing with minimum stretch. - Ittai Abraham; Cyril Gavoille; Dahlia Malkhi; Noam Nisan; Mikkel Thorup (ACM Trans. Algorithms, 2008)

Roundtrip spanners and roundtrip routing in directed graphs. - Liam Roditty; Mikkel Thorup; Uri Zwick (ACM Trans. Algorithms, 2008)

Faster Regular Expression Matching. - Philip Bille; Mikkel Thorup (ICALP (1), 2009)

Stream sampling for variance-optimal estimation of subset sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SODA, 2009)

String hashing for linear probing. - Mikkel Thorup (SODA, 2009)

Intra-domain traffic engineering with shortest path routing protocols. - Aysegül Altin; Bernard Fortz; Mikkel Thorup; Hakan Ümit (4OR, 2009)

Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Proc. VLDB Endow., 2009)

Higher Lower Bounds for Near-Neighbor and Further Rich Problems. - Mihai Patrascu; Mikkel Thorup (SIAM J. Comput., 2009)

Maximum Overhang. - Mike Paterson; Yuval Peres; Mikkel Thorup; Peter Winkler 001; Uri Zwick (Am. Math. Mon., 2009)

Tabulation Based 5-Universal Hashing and Linear Probing. - Mikkel Thorup; Yin Zhang (ALENEX, 2010)

Regular Expression Matching with Multi-Strings and Intervals. - Philip Bille; Mikkel Thorup (SODA, 2010)

Changing base without losing space. - Yevgeniy Dodis; Mihai Patrascu; Mikkel Thorup (STOC, 2010)

Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. - Omid Madani; Mikkel Thorup; Uri Zwick (ACM Trans. Algorithms, 2010)

The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. - Ken-ichi Kawarabayashi; Mikkel Thorup (FOCS, 2011)

Timeouts with time-reversed linear probing. - Mikkel Thorup (INFOCOM, 2011)

Don't rush into a union: take time to find your roots. - Mihai Patrascu; Mikkel Thorup (STOC, 2011)

Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SIAM J. Comput., 2011)

Combinatorial Coloring of 3-Colorable Graphs. - Ken-ichi Kawarabayashi; Mikkel Thorup (FOCS, 2012)

A New Infinity of Distance Oracles for Sparse Graphs. - Mihai Patrascu; Liam Roditty; Mikkel Thorup (FOCS, 2012)

The Power of Simple Tabulation Hashing. - Mihai Patrascu; Mikkel Thorup (J. ACM, 2012)

Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation. - Mikkel Thorup; Yin Zhang 001 (SIAM J. Comput., 2012)

Nearest neighbor classification using bottom-k sketches. - Søren Dahlgaard; Christian Igel; Mikkel Thorup (IEEE BigData, 2013)

Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. - Mikkel Thorup (FOCS, 2013)

More Compact Oracles for Approximate Distances in Undirected Planar Graphs. - Ken-ichi Kawarabayashi; Christian Sommer 001; Mikkel Thorup (SODA, 2013)

Twisted Tabulation Hashing. - Mihai Patrascu; Mikkel Thorup (SODA, 2013)

Bottom-k and priority sampling, set similarity and subset sums with minimal independence. - Mikkel Thorup (STOC, 2013)

Funding successful research. - Mikkel Thorup (Commun. ACM, 2013)

On the k-Independence Required by Linear Probing and Minwise Independence - Mikkel Thorup (CoRR, 2013)

Mihai Pǎtraşcu: obituary and open problems. - Mikkel Thorup (SIGACT News, 2013)

Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. - Mihai Patrascu; Mikkel Thorup (FOCS, 2014)

Coloring 3-colorable graphs with o(n^{1/5}) colors. - Ken-ichi Kawarabayashi; Mikkel Thorup (STACS, 2014)

Approximately Minwise Independence with Twisted Tabulation. - Søren Dahlgaard; Mikkel Thorup (SWAT, 2014)

Algorithms and estimators for summarization of unaggregated data streams. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (J. Comput. Syst. Sci., 2014)

Union-Find with Constant Time Deletions. - Stephen Alstrup; Mikkel Thorup; Inge Li Gørtz; Theis Rauhe; Uri Zwick (ACM Trans. Algorithms, 2014)

Hashing for Statistics over K-Partitions. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Eva Rotenberg; Mikkel Thorup (FOCS, 2015)

Planar Reachability in Linear Space and Constant Time. - Jacob Holm; Eva Rotenberg; Mikkel Thorup (FOCS, 2015)

Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication. - Valerie King; Shay Kutten; Mikkel Thorup (PODC, 2015)

From Independence to Expansion and Back Again. - Tobias Christiani; Rasmus Pagh; Mikkel Thorup (STOC, 2015)

Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. - Ken-ichi Kawarabayashi; Mikkel Thorup (STOC, 2015)

RAM-Efficient External Memory Sorting. - Lars Arge; Mikkel Thorup (Algorithmica, 2015)

Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (CoRR, 2015)

High Speed Hashing for Integers and Strings. - Mikkel Thorup (CoRR, 2015)

Linear Probing with 5-Independent Hashing. - Mikkel Thorup (CoRR, 2015)

Finding the Maximum Subset with Bounded Convex Curvature. - Mikkel Abrahamsen; Mikkel Thorup (SoCG, 2016)

Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. - Gramoz Goranci; Monika Henzinger; Mikkel Thorup (ESA, 2016)

Faster Worst Case Deterministic Dynamic Connectivity. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (ESA, 2016)

The Power of Two Choices with Simple Tabulation. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Eva Rotenberg; Mikkel Thorup (SODA, 2016)

Bottleneck Paths and Trees and Deterministic Graphical Games. - Shiri Chechik; Haim Kaplan; Mikkel Thorup; Or Zamir; Uri Zwick (STACS, 2016)

On the k-Independence Required by Linear Probing and Minwise Independence. - Mihai Patrascu; Mikkel Thorup (ACM Trans. Algorithms, 2016)

Fast Similarity Sketching. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Mikkel Thorup (FOCS, 2017)

Fast and Powerful Hashing Using Tabulation (Invited Talk). - Mikkel Thorup (ICALP, 2017)

Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. - Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Mikkel Thorup (NIPS, 2017)

Fast and powerful hashing using tabulation. - Mikkel Thorup (Commun. ACM, 2017)

Dynamic Bridge-Finding in $ tilde{O}( log ^2 n)$ Amortized Time. - Jacob Holm; Eva Rotenberg; Mikkel Thorup (CoRR, 2017)

Coloring 3-Colorable Graphs with Less than n1/5 Colors. - Ken-ichi Kawarabayashi; Mikkel Thorup (J. ACM, 2017)

Power of d Choices with Simple Tabulation. - Anders Aamand; Mathias Bæk Tejs Knudsen; Mikkel Thorup (ICALP, 2018)

Wireless coverage prediction via parametric shortest paths. - David L. Applegate; Aaron Archer; David S. Johnson 001; Evdokia Nikolova; Mikkel Thorup; Ger Yang (MobiHoc, 2018)

Dynamic Bridge-Finding in Õ(log2 n) Amortized Time. - Jacob Holm; Eva Rotenberg; Mikkel Thorup (SODA, 2018)

The Entropy of Backwards Analysis. - Mathias Bæk Tejs Knudsen; Mikkel Thorup (SODA, 2018)

Consistent Hashing with Bounded Loads. - Vahab S. Mirrokni; Mikkel Thorup; Morteza Zadimoghaddam (SODA, 2018)

Fast fencing. - Mikkel Abrahamsen; Anna Adamaszek; Karl Bringmann; Vincent Cohen-Addad; Mehran Mehr; Eva Rotenberg; Alan Roytman; Mikkel Thorup (STOC, 2018)

Contraction-Based Sparsification in Near-Linear Time. - On-Hei Solomon Lo; Jens M. Schmidt; Mikkel Thorup (CoRR, 2018)

Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8. - Mikkel Thorup (SIAM J. Comput., 2018)

Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. - Gramoz Goranci; Monika Henzinger; Mikkel Thorup (ACM Trans. Algorithms, 2018)

Hardness of Bichromatic Closest Pair with Jaccard Similarity. - Rasmus Pagh; Nina Mesing Stausholm; Mikkel Thorup (ESA, 2019)

Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. - Jacob Holm; Valerie King; Mikkel Thorup; Or Zamir; Uri Zwick (FOCS, 2019)

Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. - Mikkel Thorup; Or Zamir; Uri Zwick (ICALP, 2019)

Non-empty Bins with Simple Tabulation Hashing. - Anders Aamand; Mikkel Thorup (SODA, 2019)

Heavy hitters via cluster-preserving clustering. - Kasper Green Larsen; Jelani Nelson; Huy L. Nguyen; Mikkel Thorup (Commun. ACM, 2019)

Deterministic Edge Connectivity in Near-Linear Time. - Ken-ichi Kawarabayashi; Mikkel Thorup (J. ACM, 2019)

Adjacency Labeling Schemes and Induced-Universal Graphs. - Stephen Alstrup; Haim Kaplan; Mikkel Thorup; Uri Zwick (SIAM J. Discret. Math., 2019)

Confirmation Sampling for Exact Nearest Neighbor Search. - Tobias Christiani; Rasmus Pagh; Mikkel Thorup (SISAP, 2020)

Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. - Mohsen Ghaffari 001; Krzysztof Nowicki 002; Mikkel Thorup (SODA, 2020)

Fast hashing with strong concentration bounds. - Anders Aamand; Jakob Bæk Tejs Knudsen; Mathias Bæk Tejs Knudsen; Peter Michael Reichstein Rasmussen; Mikkel Thorup (STOC, 2020)

Three-in-a-tree in near linear time. - Kai-Yuan Lai 001; Hsueh-I Lu; Mikkel Thorup (STOC, 2020)

No Repetition: Fast Streaming with Highly Concentrated Hashing. - Anders Aamand; Debarati Das 001; Evangelos Kipouridis; Jakob Bæk Tejs Knudsen; Peter M. R. Rasmussen; Mikkel Thorup (CoRR, 2020)

The Power of Hashing with Mersenne Primes. - Thomas Dybdahl Ahle; Jakob Bæk Tejs Knudsen; Mikkel Thorup (CoRR, 2020)

Disks in Curves of Bounded Convex Curvature. - Anders Aamand; Mikkel Abrahamsen; Mikkel Thorup (Am. Math. Mon., 2020)

Load balancing with dynamic set of balls and bins. - Anders Aamand; Jakob Bæk Tejs Knudsen; Mikkel Thorup (STOC, 2021)

Sampling and Counting Edges via Vertex Accesses. - Jakub Tetek; Mikkel Thorup (CoRR, 2021)

Compact cactus representations of all non-trivial min-cuts. - On-Hei Solomon Lo; Jens M. Schmidt; Mikkel Thorup (Discret. Appl. Math., 2021)

Dijkstra's Single Source Shortest Path Algorithm. - Mikkel Thorup (Edsger Wybe Dijkstra, 2022)

Understanding the Moments of Tabulation Hashing via Chaoses. - Jakob Bæk Tejs Houen; Mikkel Thorup (ICALP, 2022)

Improved Utility Analysis of Private CountSketch. - Rasmus Pagh; Mikkel Thorup (NeurIPS, 2022)

Edge sampling and graph parameter estimation via vertex neighborhood accesses. - Jakub Tetek; Mikkel Thorup (STOC, 2022)

Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper). - Mikkel Thorup (SWAT, 2022)

No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. - Anders Aamand; Debarati Das 001; Evangelos Kipouridis; Jakob Bæk Tejs Knudsen; Peter M. R. Rasmussen; Mikkel Thorup (Proc. VLDB Endow., 2022)

Locally Uniform Hashing. - Ioana O. Bercea; Lorenzo Beretta 001; Jonas Klausen; Jakob Bæk Tejs Houen; Mikkel Thorup (FOCS, 2023)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. - Praneeth Kacham; Rasmus Pagh; Mikkel Thorup; David P. Woodruff (FOCS, 2023)

Optimal Decremental Connectivity in Non-Sparse Graphs. - Anders Aamand; Adam Karczmarz; Jakub Lacki; Nikos Parotsidis; Peter M. R. Rasmussen; Mikkel Thorup (ICALP, 2023)

A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing. - Jakob Bæk Tejs Houen; Mikkel Thorup (ICALP, 2023)

Fully Dynamic Exact Edge Connectivity in Sublinear Time. - Gramoz Goranci; Monika Henzinger; Danupon Nanongkai; Thatchaphol Saranurak; Mikkel Thorup; Christian Wulff-Nilsen (SODA, 2023)

Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (TheoretiCS, 2023)

How to Cut Corners and Get Bounded Convex Curvature. - Mikkel Abrahamsen; Mikkel Thorup (Discret. Comput. Geom., 2023)

Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018). - Elette Boyle; Vincent Cohen-Addad; Alexandra Kolla; Mikkel Thorup (SIAM J. Comput., 2023)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. - Shyam Narayanan; Václav Rozhon; Jakub Tetek; Mikkel Thorup (FOCS, 2024)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. - Wenyu Jin 001; Xiaorui Sun; Mikkel Thorup (SODA, 2024)

Minimum-cost paths for electric cars. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Mikkel Thorup; Uri Zwick (SOSA, 2024)

Combinatorial Correlation Clustering. - Vincent Cohen-Addad; David Rasmussen Lolck; Marcin Pilipczuk; Mikkel Thorup; Shuyi Yan; Hanwen Zhang 003 (STOC, 2024)

Better Coloring of 3-Colorable Graphs. - Ken-ichi Kawarabayashi; Mikkel Thorup; Hirotaka Yoneda (STOC, 2024)

Hashing for Sampling-Based Estimation. - Anders Aamand; Ioana O. Bercea; Jakob Bæk Tejs Houen; Jonas Klausen; Mikkel Thorup (CoRR, 2024)

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. - Vincent Cohen-Addad; Debarati Das 001; Evangelos Kipouridis; Nikos Parotsidis; Mikkel Thorup (J. ACM, 2024)

Faster All-Pairs Optimal Electric Car Routing. - Dani Dorfman; Haim Kaplan; Robert E. Tarjan; Mikkel Thorup; Uri Zwick (ICALP, 2025)

A Faster Algorithm for Constrained Correlation Clustering. - Nick Fischer; Evangelos Kipouridis; Jonas Klausen; Mikkel Thorup (STACS, 2025)

Solving the Correlation Cluster LP in Sublinear Time. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; David Rasmussen Lolck; Alantha Newman; Mikkel Thorup; Lukas Vogl; Shuyi Yan; Hanwen Zhang 003 (STOC, 2025)

Static to Dynamic Correlation Clustering. - Nairen Cao; Vincent Cohen-Addad; Euiwoong Lee; Shi Li 001; David Rasmussen Lolck; Alantha Newman; Mikkel Thorup; Lukas Vogl; Shuyi Yan; Hanwen Zhang 003 (CoRR, 2025)

Estimating Random-Walk Probabilities in Directed Graphs. - Christian Bertram; Mads Vestergaard Jensen; Mikkel Thorup; Hanzhi Wang 001; Shuyi Yan (CoRR, 2025)

PageRank Centrality in Directed Graphs with Bounded In-Degree. - Mikkel Thorup; Hanzhi Wang 001; Zhewei Wei; Mingji Yang 001 (CoRR, 2025)