Mikkel Thorup - RankMe

318 papers A* 111A 20B 11Misc 1Journal 158Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	PageRank Centrality in Directed Graphs with Bounded In-Degree. SODA Mikkel Thorup, Hanzhi Wang, Zhewei Wei, Mingji Yang
2026	J	`jnl`	Pivot based correlation clustering in the presence of good clusters. CoRR David Rasmussen Lolck, Mikkel Thorup, Shuyi Yan
2026	J	`jnl`	The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring. CoRR Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup
2025	A	`conf`	A Faster Algorithm for Constrained Correlation Clustering. STACS Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
2025	J	`jnl`	A Faster Algorithm for Constrained Correlation Clustering. CoRR Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
2025	J	`jnl`	Estimating Random-Walk Probabilities in Directed Graphs. CoRR Christian Bertram, Mads Vestergaard Jensen, Mikkel Thorup, Hanzhi Wang, Shuyi Yan
2025	A*	`conf`	Faster All-Pairs Optimal Electric Car Routing. ICALP Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025	J	`jnl`	Faster All-Pairs Optimal Electric Car Routing. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2025	B	`conf`	Hash Functions Bridging the Gap from Theory to Practice (Invited Talk). ISAAC Mikkel Thorup
2025	J	`jnl`	Instance Optimality in PageRank Centrality Estimation. CoRR Mikkel Thorup, Hanzhi Wang
2025	J	`jnl`	PageRank Centrality in Directed Graphs with Bounded In-Degree. CoRR Mikkel Thorup, Hanzhi Wang, Zhewei Wei, Mingji Yang
2025	A*	`conf`	Solving the Correlation Cluster LP in Sublinear Time. STOC Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang
2025	J	`jnl`	Solving the Correlation Cluster LP in Sublinear Time. CoRR Nairen Cao, Vincent Cohen-Addad, Shi Li, Euiwoong Lee, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang
2025	J	`jnl`	Static to Dynamic Correlation Clustering. CoRR Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang
2024	A*	`conf`	Better Coloring of 3-Colorable Graphs. STOC Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
2024	J	`jnl`	Better coloring of 3-colorable graphs. CoRR Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
2024	A*	`conf`	Combinatorial Correlation Clustering. STOC Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang
2024	J	`jnl`	Combinatorial Correlation Clustering. CoRR Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang
2024	J	`jnl`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2024	A*	`conf`	Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. SODA Wenyu Jin, Xiaorui Sun, Mikkel Thorup
2024	J	`jnl`	Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. CoRR Wenyu Jin, Xiaorui Sun, Mikkel Thorup
2024	J	`jnl`	Hashing for Sampling-Based Estimation. CoRR Anders Aamand, Ioana O. Bercea, Jakob Bæk Tejs Houen, Jonas Klausen, Mikkel Thorup
2024	A*	`conf`	Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. FOCS Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup
2024	J	`jnl`	Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. CoRR Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup
2024	—	`conf`	Minimum-cost paths for electric cars. SOSA Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2024	J	`jnl`	Minimum-cost paths for electric cars. CoRR Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
2023	A*	`conf`	A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing. ICALP Jakob Bæk Tejs Houen, Mikkel Thorup
2023	J	`jnl`	A Sparse Johnson-Lindenstrauss Transform using Fast Hashing. CoRR Jakob Bæk Tejs Houen, Mikkel Thorup
2023	J	`jnl`	Fully Dynamic Connectivity in O(log n(loglog n) TheoretiCS Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
2023	A*	`conf`	Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
2023	J	`jnl`	Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
2023	J	`jnl`	How to Cut Corners and Get Bounded Convex Curvature. Discret. Comput. Geom. Mikkel Abrahamsen, Mikkel Thorup
2023	A*	`conf`	Locally Uniform Hashing. FOCS Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup
2023	J	`jnl`	Locally Uniform Hashing. CoRR Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup
2023	A*	`conf`	Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2023	A*	`conf`	Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. FOCS Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff
2023	J	`jnl`	Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. CoRR Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff
2023	J	`jnl`	Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018). SIAM J. Comput. Elette Boyle, Vincent Cohen-Addad, Alexandra Kolla, Mikkel Thorup
2022	—	`ch.`	Dijkstra's Single Source Shortest Path Algorithm. Edsger Wybe Dijkstra Mikkel Thorup
2022	A*	`conf`	Edge sampling and graph parameter estimation via vertex neighborhood accesses. STOC Jakub Tetek, Mikkel Thorup
2022	A*	`conf`	Improved Utility Analysis of Private CountSketch. NeurIPS Rasmus Pagh, Mikkel Thorup
2022	J	`jnl`	Improved Utility Analysis of Private CountSketch. CoRR Rasmus Pagh, Mikkel Thorup
2022	J	`jnl`	No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. Proc. VLDB Endow. Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup
2022	—	`conf`	Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper). SWAT Mikkel Thorup
2022	A*	`conf`	Understanding the Moments of Tabulation Hashing via Chaoses. ICALP Jakob Bæk Tejs Houen, Mikkel Thorup
2022	J	`jnl`	Understanding the Moments of Tabulation Hashing via Chaoses. CoRR Jakob Bæk Tejs Houen, Mikkel Thorup
2021	J	`jnl`	Compact cactus representations of all non-trivial min-cuts. Discret. Appl. Math. On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
2021	A*	`conf`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2021	J	`jnl`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. CoRR Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2021	J	`jnl`	Load Balancing with Dynamic Set of Balls and Bins. CoRR Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup
2021	A*	`conf`	Load balancing with dynamic set of balls and bins. STOC Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup
2021	J	`jnl`	Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2021	J	`jnl`	Sampling and Counting Edges via Vertex Accesses. CoRR Jakub Tetek, Mikkel Thorup
2020	B	`conf`	Confirmation Sampling for Exact Nearest Neighbor Search. SISAP Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2020	J	`jnl`	Disks in Curves of Bounded Convex Curvature. Am. Math. Mon. Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup
2020	A*	`conf`	Fast hashing with strong concentration bounds. STOC Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup
2020	A*	`conf`	Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. SODA Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
2020	J	`jnl`	No Repetition: Fast Streaming with Highly Concentrated Hashing. CoRR Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup
2020	J	`jnl`	The Power of Hashing with Mersenne Primes. CoRR Thomas Dybdahl Ahle, Jakob Bæk Tejs Knudsen, Mikkel Thorup
2020	A*	`conf`	Three-in-a-tree in near linear time. STOC Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup
2019	J	`jnl`	Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2019	J	`jnl`	Deterministic Edge Connectivity in Near-Linear Time. J. ACM Ken-ichi Kawarabayashi, Mikkel Thorup
2019	J	`jnl`	Disks in Curves of Bounded Convex Curvature. CoRR Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup
2019	A*	`conf`	Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP Mikkel Thorup, Or Zamir, Uri Zwick
2019	J	`jnl`	Fast hashing with Strong Concentration Bounds. CoRR Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup
2019	J	`jnl`	Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. CoRR Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
2019	A	`conf`	Hardness of Bichromatic Closest Pair with Jaccard Similarity. ESA Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup
2019	J	`jnl`	Hardness of Bichromatic Closest Pair with Jaccard Similarity. CoRR Rasmus Pagh, Nina Stausholm, Mikkel Thorup
2019	J	`jnl`	Heavy hitters via cluster-preserving clustering. Commun. ACM Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
2019	A*	`conf`	Non-empty Bins with Simple Tabulation Hashing. SODA Anders Aamand, Mikkel Thorup
2019	A*	`conf`	Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
2019	J	`jnl`	Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
2019	J	`jnl`	Three-in-a-Tree in Near Linear Time. CoRR Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup
2018	A*	`ed.`	59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018 FOCS Mikkel Thorup
2018	J	`jnl`	Confirmation Sampling for Exact Nearest Neighbor Search. CoRR Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2018	A*	`conf`	Consistent Hashing with Bounded Loads. SODA Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
2018	J	`jnl`	Contraction-Based Sparsification in Near-Linear Time. CoRR On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
2018	A*	`conf`	Dynamic Bridge-Finding in SODA Jacob Holm, Eva Rotenberg, Mikkel Thorup
2018	J	`jnl`	Fast Fencing. CoRR Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
2018	A*	`conf`	Fast fencing. STOC Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
2018	J	`jnl`	Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ACM Trans. Algorithms Gramoz Goranci, Monika Henzinger, Mikkel Thorup
2018	J	`jnl`	Non-Empty Bins with Simple Tabulation Hashing. CoRR Anders Aamand, Mikkel Thorup
2018	A*	`conf`	Power of d Choices with Simple Tabulation. ICALP Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2018	J	`jnl`	Power of d Choices with Simple Tabulation. CoRR Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2018	J	`jnl`	Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8. SIAM J. Comput. Mikkel Thorup
2018	A*	`conf`	The Entropy of Backwards Analysis. SODA Mathias Bæk Tejs Knudsen, Mikkel Thorup
2018	B	`conf`	Wireless coverage prediction via parametric shortest paths. MobiHoc David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang
2018	J	`jnl`	Wireless coverage prediction via parametric shortest paths. CoRR David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang
2017	J	`jnl`	Coloring 3-Colorable Graphs with Less than J. ACM Ken-ichi Kawarabayashi, Mikkel Thorup
2017	J	`jnl`	Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time. CoRR Jacob Holm, Eva Rotenberg, Mikkel Thorup
2017	A*	`conf`	Fast Similarity Sketching. FOCS Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	J	`jnl`	Fast Similarity Sketching. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	A*	`conf`	Fast and Powerful Hashing Using Tabulation (Invited Talk). ICALP Mikkel Thorup
2017	A	`conf`	Fast and Powerful Hashing using Tabulation. FOGA Mikkel Thorup
2017	J	`jnl`	Fast and powerful hashing using tabulation. Commun. ACM Mikkel Thorup
2017	—	`conf`	Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. NIPS Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	J	`jnl`	Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
2017	J	`jnl`	The Entropy of Backwards Analysis. CoRR Mathias Bæk Tejs Knudsen, Mikkel Thorup
2016	A	`conf`	Bottleneck Paths and Trees and Deterministic Graphical Games. STACS Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick
2016	J	`jnl`	Consistent Hashing with Bounded Loads. CoRR Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
2016	—	`conf`	Fast and Powerful Hashing Using Tabulation (Invited Talk). FSTTCS Mikkel Thorup
2016	A	`conf`	Faster Worst Case Deterministic Dynamic Connectivity. ESA Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
2016	A*	`conf`	Finding the Maximum Subset with Bounded Convex Curvature. SoCG Mikkel Abrahamsen, Mikkel Thorup
2016	J	`jnl`	Finding the Maximum Subset with Bounded Convex Curvature. CoRR Mikkel Abrahamsen, Mikkel Thorup
2016	A*	`conf`	Heavy Hitters via Cluster-Preserving Clustering. FOCS Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
2016	J	`jnl`	Heavy hitters via cluster-preserving clustering. CoRR Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
2016	A	`conf`	Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ESA Gramoz Goranci, Monika Henzinger, Mikkel Thorup
2016	J	`jnl`	Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. CoRR Gramoz Goranci, Monika Henzinger, Mikkel Thorup
2016	J	`jnl`	On the ACM Trans. Algorithms Mihai Patrascu, Mikkel Thorup
2016	A*	`conf`	The Power of Two Choices with Simple Tabulation. SODA Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
2015	A*	`conf`	Adjacency Labeling Schemes and Induced-Universal Graphs. STOC Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2015	A*	`conf`	Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication. PODC Valerie King, Shay Kutten, Mikkel Thorup
2015	J	`jnl`	Construction and impromptu repair of an MST in a distributed network with o(m) communication. CoRR Valerie King, Shay Kutten, Mikkel Thorup
2015	A*	`conf`	Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. STOC Ken-ichi Kawarabayashi, Mikkel Thorup
2015	J	`jnl`	Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. CoRR Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
2015	J	`jnl`	Fast and Powerful Hashing using Tabulation. CoRR Mikkel Thorup
2015	A*	`conf`	From Independence to Expansion and Back Again. STOC Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2015	J	`jnl`	From Independence to Expansion and Back Again. CoRR Tobias Christiani, Rasmus Pagh, Mikkel Thorup
2015	A*	`conf`	Hashing for Statistics over K-Partitions. FOCS Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
2015	J	`jnl`	High Speed Hashing for Integers and Strings. CoRR Mikkel Thorup
2015	J	`jnl`	Linear Probing with 5-Independent Hashing. CoRR Mikkel Thorup
2015	A*	`conf`	Planar Reachability in Linear Space and Constant Time. FOCS Jacob Holm, Eva Rotenberg, Mikkel Thorup
2015	J	`jnl`	RAM-Efficient External Memory Sorting. Algorithmica Lars Arge, Mikkel Thorup
2015	A*	`conf`	Sample (x) = (a*x<=t) is a Distinguisher with Probability 1/8. FOCS Mikkel Thorup
2014	J	`jnl`	Adjacency labeling schemes and induced-universal graphs. CoRR Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
2014	J	`jnl`	Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2014	—	`conf`	Approximately Minwise Independence with Twisted Tabulation. SWAT Søren Dahlgaard, Mikkel Thorup
2014	J	`jnl`	Approximately Minwise Independence with Twisted Tabulation. CoRR Søren Dahlgaard, Mikkel Thorup
2014	A	`conf`	Coloring 3-colorable graphs with o(n^{1/5}) colors. STACS Ken-ichi Kawarabayashi, Mikkel Thorup
2014	J	`jnl`	Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. CoRR Ken-ichi Kawarabayashi, Mikkel Thorup
2014	A*	`conf`	Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. FOCS Mihai Patrascu, Mikkel Thorup
2014	J	`jnl`	Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. CoRR Mihai Patrascu, Mikkel Thorup
2014	J	`jnl`	Hashing for statistics over k-partitions. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
2014	J	`jnl`	Planar Reachability in Linear Space and Constant Time. CoRR Jacob Holm, Eva Rotenberg, Mikkel Thorup
2014	J	`jnl`	Sample(x)=(a*x<=t) is a distinguisher with probability 1/8. CoRR Mikkel Thorup
2014	J	`jnl`	The Power of Two Choices with Simple Tabulation. CoRR Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
2014	J	`jnl`	Union-Find with Constant Time Deletions. ACM Trans. Algorithms Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick
2013	J	`jnl`	Bottom-k and Priority Sampling, Set Similarity and Subset Sums with Minimal Independence CoRR Mikkel Thorup
2013	A*	`conf`	Bottom-k and priority sampling, set similarity and subset sums with minimal independence. STOC Mikkel Thorup
2013	J	`jnl`	Funding successful research. Commun. ACM Mikkel Thorup
2013	J	`jnl`	Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit
2013	J	`jnl`	Mihai Patrascu: Obituary and Open Problems. Bull. EATCS Mikkel Thorup
2013	J	`jnl`	Mihai Pǎtraşcu: obituary and open problems. SIGACT News Mikkel Thorup
2013	A*	`conf`	More Compact Oracles for Approximate Distances in Undirected Planar Graphs. SODA Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup
2013	—	`conf`	Nearest neighbor classification using bottom-k sketches. IEEE BigData Søren Dahlgaard, Christian Igel, Mikkel Thorup
2013	J	`jnl`	On the k-Independence Required by Linear Probing and Minwise Independence CoRR Mikkel Thorup
2013	B	`conf`	RAM-Efficient External Memory Sorting. ISAAC Lars Arge, Mikkel Thorup
2013	J	`jnl`	RAM-Efficient External Memory Sorting. CoRR Lars Arge, Mikkel Thorup
2013	A*	`conf`	Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. FOCS Mikkel Thorup
2013	J	`jnl`	Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. CoRR Mikkel Thorup
2013	A*	`conf`	Twisted Tabulation Hashing. SODA Mihai Patrascu, Mikkel Thorup
2012	A*	`conf`	A New Infinity of Distance Oracles for Sparse Graphs. FOCS Mihai Patrascu, Liam Roditty, Mikkel Thorup
2012	A*	`conf`	Combinatorial Coloring of 3-Colorable Graphs. FOCS Ken-ichi Kawarabayashi, Mikkel Thorup
2012	J	`jnl`	Combinatorial coloring of 3-colorable graphs CoRR Ken-ichi Kawarabayashi, Mikkel Thorup
2012	J	`jnl`	Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation. SIAM J. Comput. Mikkel Thorup, Yin Zhang
2012	J	`jnl`	The Power of Simple Tabulation Hashing. J. ACM Mihai Patrascu, Mikkel Thorup
2011	J	`jnl`	Don't Rush into a Union: Take Time to Find Your Roots CoRR Mihai Patrascu, Mikkel Thorup
2011	A*	`conf`	Don't rush into a union: take time to find your roots. STOC Mihai Patrascu, Mikkel Thorup
2011	J	`jnl`	Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2011	J	`jnl`	Minimum k-way cut of bounded size is fixed-parameter tractable CoRR Ken-ichi Kawarabayashi, Mikkel Thorup
2011	A*	`conf`	The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. FOCS Ken-ichi Kawarabayashi, Mikkel Thorup
2011	A*	`conf`	The power of simple tabulation hashing. STOC Mihai Patrascu, Mikkel Thorup
2011	A*	`conf`	Timeouts with time-reversed linear probing. INFOCOM Mikkel Thorup
2010	A*	`conf`	Changing base without losing space. STOC Yevgeniy Dodis, Mihai Patrascu, Mikkel Thorup
2010	J	`jnl`	Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. ACM Trans. Algorithms Omid Madani, Mikkel Thorup, Uri Zwick
2010	—	`conf`	On the ICALP (1) Mihai Patrascu, Mikkel Thorup
2010	A*	`conf`	Regular Expression Matching with Multi-Strings and Intervals. SODA Philip Bille, Mikkel Thorup
2010	A	`conf`	Tabulation Based 5-Universal Hashing and Linear Probing. ALENEX Mikkel Thorup, Yin Zhang
2010	J	`jnl`	The Power of Simple Tabulation Hashing CoRR Mihai Patrascu, Mikkel Thorup
2009	J	`jnl`	Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2009	A*	`conf`	Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. SODA Omid Madani, Mikkel Thorup, Uri Zwick
2009	—	`conf`	Faster Regular Expression Matching. ICALP (1) Philip Bille, Mikkel Thorup
2009	J	`jnl`	Higher Lower Bounds for Near-Neighbor and Further Rich Problems. SIAM J. Comput. Mihai Patrascu, Mikkel Thorup
2009	J	`jnl`	Intra-domain traffic engineering with shortest path routing protocols. 4OR Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit
2009	J	`jnl`	Maximum Overhang. Am. Math. Mon. Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick
2009	A*	`conf`	Stream sampling for variance-optimal estimation of subset sums. SODA Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2009	A*	`conf`	String hashing for linear probing. SODA Mikkel Thorup
2008	J	`jnl`	Compact name-independent routing with minimum stretch. ACM Trans. Algorithms Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
2008	A*	`conf`	Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup
2008	A*	`conf`	Maximum overhang. SODA Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick
2008	A*	`conf`	Minimum k-way cuts via deterministic greedy tree packing. STOC Mikkel Thorup
2008	J	`jnl`	Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran
2008	J	`jnl`	Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms Liam Roditty, Mikkel Thorup, Uri Zwick
2008	J	`jnl`	Speeding Up Dynamic Shortest-Path Algorithms. INFORMS J. Comput. Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup
2008	J	`jnl`	Variance optimal sampling based estimation of subset sums CoRR Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	A	`conf`	Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	A	`conf`	Compact Oracles for Approximate Distances Around Obstacles in the Plane. ESA Mikkel Thorup
2007	J	`jnl`	Dynamic ordered sets with exponential search trees. J. ACM Arne Andersson, Mikkel Thorup
2007	J	`jnl`	Equivalence between priority queues and sorting. J. ACM Mikkel Thorup
2007	J	`jnl`	Fully-Dynamic Min-Cut. Comb. Mikkel Thorup
2007	A	`conf`	On the Variance of Subset Sum Estimation. ESA Mario Szegedy, Mikkel Thorup
2007	J	`jnl`	On the variance of subset sum estimation CoRR Mario Szegedy, Mikkel Thorup
2007	A*	`conf`	Planning for Fast Connectivity Updates. FOCS Mihai Patrascu, Mikkel Thorup
2007	J	`jnl`	Priority sampling for estimation of arbitrary subset sums. J. ACM Nick G. Duffield, Carsten Lund, Mikkel Thorup
2007	A*	`conf`	Randomization does not help searching predecessors. SODA Mihai Patrascu, Mikkel Thorup
2007	A*	`conf`	Sketching unaggregated data streams for subpopulation-size queries. PODS Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	J	`jnl`	Survivable IP network design with OSPF routing. Networks Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup
2006	—	`conf`	Confidence intervals for priority sampling. SIGMETRICS/Performance Mikkel Thorup
2006	A	`conf`	Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup
2006	A*	`conf`	Higher Lower Bounds for Near-Neighbor and Further Rich Problems. FOCS Mihai Patrascu, Mikkel Thorup
2006	J	`jnl`	Melding priority queues. ACM Trans. Algorithms Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
2006	A*	`conf`	Spanners and emulators with sublinear distance errors. SODA Mikkel Thorup, Uri Zwick
2006	J	`jnl`	Time-Space Trade-Offs for Predecessor Search CoRR Mihai Patrascu, Mikkel Thorup
2006	A*	`conf`	Time-space trade-offs for predecessor search. STOC Mihai Patrascu, Mikkel Thorup
2005	J	`jnl`	A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup
2005	J	`jnl`	Approximate distance oracles. J. ACM Mikkel Thorup, Uri Zwick
2005	J	`jnl`	Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
2005	A*	`conf`	Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP Liam Roditty, Mikkel Thorup, Uri Zwick
2005	A*	`conf`	Estimating arbitrary subset sums with few probes. PODS Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	J	`jnl`	Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw. Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	J	`jnl`	Learn more, sample less: control of volume and variance in network measurement. IEEE Trans. Inf. Theory Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	J	`jnl`	Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
2005	A	`conf`	Optimal Combination of Sampled Network Measurements. Internet Measurement Conference Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	J	`jnl`	Sampling to estimate arbitrary subset sums CoRR Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	A*	`conf`	Union-Find with Constant Time Deletions. ICALP Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick
2005	A*	`conf`	Worst-case update times for fully-dynamic all-pairs shortest paths. STOC Mikkel Thorup
2004	B	`conf`	Compact name-independent routing with minimum stretch. SPAA Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup
2004	J	`jnl`	Compact oracles for reachability and approximate distances in planar digraphs. J. ACM Mikkel Thorup
2004	A*	`conf`	Flow sampling under hard resource constraints. SIGMETRICS Nick G. Duffield, Carsten Lund, Mikkel Thorup
2004	—	`conf`	Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. SWAT Mikkel Thorup
2004	J	`jnl`	Increasing Internet Capacity Using Local Search. Comput. Optim. Appl. Bernard Fortz, Mikkel Thorup
2004	J	`jnl`	Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. Comput. Syst. Sci. Mikkel Thorup
2004	A*	`conf`	Meldable RAM priority queues and minimum directed spanning trees. SODA Ran Mendelson, Mikkel Thorup, Uri Zwick
2004	—	`conf`	Melding Priority Queues. SWAT Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
2004	J	`jnl`	OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
2004	A	`conf`	On Adaptive Integer Sorting. ESA Anna Pagh, Rasmus Pagh, Mikkel Thorup
2004	J	`jnl`	Quick k-Median, k-Center, and Facility Location for Sparse Graphs. SIAM J. Comput. Mikkel Thorup
2004	J	`jnl`	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
2004	A*	`conf`	Tabulation based 4-universal hashing with applications to second moment estimation. SODA Mikkel Thorup, Yin Zhang
2003	J	`jnl`	Combinatorial power in multimedia processors. SIGARCH Comput. Archit. News Mikkel Thorup
2003	A*	`conf`	Estimating flow distributions from sampled flow statistics. SIGCOMM Nick G. Duffield, Carsten Lund, Mikkel Thorup
2003	A*	`conf`	Integer priority queues with decrease key in constant time and the single source shortest paths problem. STOC Mikkel Thorup
2003	A*	`conf`	Load optimal MPLS routing with N+M labels. INFOCOM David L. Applegate, Mikkel Thorup
2003	J	`jnl`	Maintaining Information in Fully-Dynamic Trees with Top Trees CoRR Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
2003	A*	`conf`	OPT versus LOAD in dynamic storage allocation. STOC Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
2003	A*	`conf`	On AC SODA Mikkel Thorup
2003	A*	`conf`	Performance of estimated traffic matrices in traffic engineering. SIGMETRICS Matthew Roughan, Mikkel Thorup, Yin Zhang
2003	A*	`conf`	Quick and good facility location. SODA Mikkel Thorup
2003	A*	`conf`	Space efficient dynamic stabbing with fast queries. STOC Mikkel Thorup
2003	A	`conf`	Traffic engineering with estimated traffic matrices. Internet Measurement Conference Matthew Roughan, Mikkel Thorup, Yin Zhang
2003	B	`conf`	Tree based MPLS routing. SPAA Anupam Gupta, Amit Kumar, Mikkel Thorup
2003	J	`jnl`	Untangling the balancing and searching of balanced binary search trees. Softw. Pract. Exp. Matthew H. Austern, Bjarne Stroustrup, Mikkel Thorup, John Wilkinson
2002	J	`jnl`	Dynamic Ordered Sets with Exponential Search Trees CoRR Arne Andersson, Mikkel Thorup
2002	J	`jnl`	Efficient Tree Layout in a Multilevel Memory Hierarchy CoRR Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup
2002	A*	`conf`	Equivalence between Priority Queues and Sorting. FOCS Mikkel Thorup
2002	A*	`conf`	Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. FOCS Yijie Han, Mikkel Thorup
2002	A	`conf`	On Distance Oracles and Routing in Graphs. ESA Mikkel Thorup
2002	J	`jnl`	Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Sel. Areas Commun. Bernard Fortz, Mikkel Thorup
2002	A*	`conf`	Oracles for distances avoiding a link-failure. SODA Camil Demetrescu, Mikkel Thorup
2002	A	`conf`	Properties and prediction of flow statistics from sampled packet streams. Internet Measurement Workshop Nick G. Duffield, Carsten Lund, Mikkel Thorup
2002	J	`jnl`	Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. J. Algorithms Mikkel Thorup
2002	J	`jnl`	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut CoRR David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
2002	A*	`conf`	Roundtrip spanners and roundtrip routing in directed graphs. SODA Liam Roditty, Mikkel Thorup, Uri Zwick
2002	J	`jnl`	Traffic engineering with traditional IP routing protocols. IEEE Commun. Mag. Bernard Fortz, Jennifer Rexford, Mikkel Thorup
2001	Misc	`conf`	A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. COCOON Valerie King, Mikkel Thorup
2001	J	`jnl`	An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. ACM J. Exp. Algorithmics Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup
2001	A*	`conf`	Approximate distance oracles. STOC Mikkel Thorup, Uri Zwick
2001	A	`conf`	Charging from sampled network usage. Internet Measurement Workshop Nick G. Duffield, Carsten Lund, Mikkel Thorup
2001	A*	`conf`	Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. FOCS Mikkel Thorup
2001	B	`conf`	Compact routing schemes. SPAA Mikkel Thorup, Uri Zwick
2001	A*	`conf`	Dynamic string searching. SODA Arne Andersson, Mikkel Thorup
2001	A*	`conf`	Fully-dynamic min-cut. STOC Mikkel Thorup
2001	J	`jnl`	Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
2001	A*	`conf`	Quick k-Median, k-Center, and Facility Location for Sparse Graphs. ICALP Mikkel Thorup
2000	J	`jnl`	An SIAM J. Comput. Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup
2000	—	`conf`	Dynamic Graph Algorithms with Applications. SWAT Mikkel Thorup, David R. Karger
2000	A*	`conf`	Even strongly universal hashing is pretty fast. SODA Mikkel Thorup
2000	J	`jnl`	Floats, Integers, and Single Source Shortest Paths. J. Algorithms Mikkel Thorup
2000	J	`jnl`	Generalized Dominators for Structured Programs. Algorithmica Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup
2000	A*	`conf`	Internet Traffic Engineering by Optimizing OSPF Weights. INFOCOM Bernard Fortz, Mikkel Thorup
2000	—	`conf`	Maintaining Center and Median in Dynamic Trees. SWAT Stephen Alstrup, Jacob Holm, Mikkel Thorup
2000	A*	`conf`	Near-optimal fully-dynamic graph connectivity. STOC Mikkel Thorup
2000	J	`jnl`	On RAM Priority Queues. SIAM J. Comput. Mikkel Thorup
2000	J	`jnl`	Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. J. Algorithms Stephen Alstrup, Mikkel Thorup
2000	A*	`conf`	Tight(er) worst-case bounds on dynamic searching and priority queues. STOC Arne Andersson, Mikkel Thorup
2000	A*	`conf`	Word encoding tree connectivity works. SODA Stephen Alstrup, Jens P. Secher, Mikkel Thorup
1999	J	`jnl`	Decremental Dynamic Connectivity. J. Algorithms Mikkel Thorup
1999	J	`jnl`	Dominators in Linear Time. SIAM J. Comput. Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup
1999	J	`jnl`	Fusion Trees can be Implemented with AC Theor. Comput. Sci. Arne Andersson, Peter Bro Miltersen, Mikkel Thorup
1999	J	`jnl`	On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SIAM J. Comput. Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup
1999	A*	`conf`	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. STOC David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
1999	J	`jnl`	Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. ACM Mikkel Thorup
1998	J	`jnl`	All Structured Programs have Small Tree-Width and Good Register Allocation. Inf. Comput. Mikkel Thorup
1998	A*	`conf`	Direct Routing on Trees (Extended Abstract). SODA Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
1998	A*	`conf`	Faster Deterministic Sorting and Priority Queues in Linear Space. SODA Mikkel Thorup
1998	A	`conf`	Floats, Integers, and Single Source Shortest Paths. STACS Mikkel Thorup
1998	A*	`conf`	Map Graphs in Polynomial Time. FOCS Mikkel Thorup
1998	A*	`conf`	Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. STOC Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
1998	J	`jnl`	String Matching in Lempel-Ziv Compressed Strings. Algorithmica Martin Farach, Mikkel Thorup
1997	A*	`conf`	Decremental Dynamic Connectivity. SODA Mikkel Thorup
1997	B	`conf`	Finding Cores of Limited Length. WADS Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup
1997	A*	`conf`	Minimizing Diameters of Dynamic Trees. ICALP Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
1997	J	`jnl`	Parallel Shortcutting of Rooted Trees. J. Algorithms Mikkel Thorup
1997	A*	`conf`	Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. SODA Mikkel Thorup
1997	J	`jnl`	Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Struct. Algorithms Monika Rauch Henzinger, Mikkel Thorup
1997	J	`jnl`	Sparse Dynamic Programming for Evolutionary-Tree Comparison. SIAM J. Comput. Martin Farach, Mikkel Thorup
1997	B	`conf`	Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). WG Mikkel Thorup
1997	A*	`conf`	Undirected Single Source Shortest Path in Linear Time. FOCS Mikkel Thorup
1996	J	`jnl`	Disambiguating Grammars by Exclusion of Sub-Parse Trees. Acta Informatica Mikkel Thorup
1996	J	`jnl`	Efficient Preprocessing of Simple Binay Pattern Forests. J. Algorithms Mikkel Thorup
1996	B	`conf`	Generalized Dominators for Structured Programs. SAS Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup
1996	A*	`conf`	Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP Monika Rauch Henzinger, Mikkel Thorup
1996	A*	`conf`	On RAM Priority Queues. SODA Mikkel Thorup
1996	A*	`conf`	On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SODA Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup
1996	—	`conf`	Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. SWAT Stephen Alstrup, Mikkel Thorup
1996	A*	`conf`	Static Dictionaries on AC FOCS Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup
1995	A	`conf`	Computing the Agreement of Trees with Bounded Degrees. ESA Martin Farach, Teresa M. Przytycka, Mikkel Thorup
1995	J	`jnl`	Fast Comparison of Evolutionary Trees. Inf. Comput. Martin Farach, Mikkel Thorup
1995	J	`jnl`	On the Agreement of Many Trees. Inf. Process. Lett. Martin Farach, Teresa M. Przytycka, Mikkel Thorup
1995	J	`jnl`	Shortcutting Planar Digraphs. Comb. Probab. Comput. Mikkel Thorup
1995	A*	`conf`	String matching in Lempel-Ziv compressed strings. STOC Martin Farach, Mikkel Thorup
1994	J	`jnl`	Controlled Grammatic Ambiguity. ACM Trans. Program. Lang. Syst. Mikkel Thorup
1994	—	`conf`	Efficient Preprocessing of Simple Binary Pattern Forests. SWAT Mikkel Thorup
1994	A*	`conf`	Fast Comparison of Evolutionary Trees. SODA Martin Farach, Mikkel Thorup
1994	A*	`conf`	Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) FOCS Martin Farach, Mikkel Thorup
1992	B	`conf`	On Shortcutting Digraphs. WG Mikkel Thorup
1991	J	`jnl`	On Conservative Extensions of Syntax in System Development. Theor. Comput. Sci. Andrzej Blikle, Andrzej Tarlecki, Mikkel Thorup
1990	—	`conf`	On Conservative Extensions of Syntax in the Process of System Development. VDM Europe Andrzej Blikle, Mikkel Thorup