default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikkel Thorup
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j81]Vincent Cohen-Addad
, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM 71(2): 10:1-10:41 (2024)- [c152]Wenyu Jin, Xiaorui Sun, Mikkel Thorup:
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. SODA 2024: 2999-3026 - [c151]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. SOSA 2024: 374-382 - [c150]Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda:
Better Coloring of 3-Colorable Graphs. STOC 2024: 331-339 - [c149]Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang:
Combinatorial Correlation Clustering. STOC 2024: 1617-1628 - [i66]Wenyu Jin, Xiaorui Sun, Mikkel Thorup:
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. CoRR abs/2401.09700 (2024) - [i65]Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick:
Minimum-cost paths for electric cars. CoRR abs/2403.16936 (2024) - [i64]Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang:
Combinatorial Correlation Clustering. CoRR abs/2404.05433 (2024) - [i63]Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda:
Better coloring of 3-colorable graphs. CoRR abs/2406.00357 (2024) - 2023
- [j80]Mikkel Abrahamsen, Mikkel Thorup:
How to Cut Corners and Get Bounded Convex Curvature. Discret. Comput. Geom. 69(4): 1195-1231 (2023) - [j79]Elette Boyle, Vincent Cohen-Addad, Alexandra Kolla, Mikkel Thorup:
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018). SIAM J. Comput. 52(6): S18- (2023) - [j78]Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. TheoretiCS 2 (2023) - [c148]Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup:
Locally Uniform Hashing. FOCS 2023: 1440-1470 - [c147]Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff:
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. FOCS 2023: 1515-1550 - [c146]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP 2023: 6:1-6:17 - [c145]Jakob Bæk Tejs Houen, Mikkel Thorup:
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing. ICALP 2023: 76:1-76:20 - [c144]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - [i62]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - [i61]Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff:
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. CoRR abs/2304.06853 (2023) - [i60]Jakob Bæk Tejs Houen, Mikkel Thorup:
A Sparse Johnson-Lindenstrauss Transform using Fast Hashing. CoRR abs/2305.03110 (2023) - [i59]Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup:
Locally Uniform Hashing. CoRR abs/2308.14134 (2023) - 2022
- [j77]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. Proc. VLDB Endow. 15(13): 3989-4001 (2022) - [c143]Jakob Bæk Tejs Houen, Mikkel Thorup:
Understanding the Moments of Tabulation Hashing via Chaoses. ICALP 2022: 74:1-74:19 - [c142]Rasmus Pagh, Mikkel Thorup:
Improved Utility Analysis of Private CountSketch. NeurIPS 2022 - [c141]Jakub Tetek, Mikkel Thorup:
Edge sampling and graph parameter estimation via vertex neighborhood accesses. STOC 2022: 1116-1129 - [c140]Mikkel Thorup:
Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper). SWAT 2022: 3:1-3:2 - [p1]Mikkel Thorup:
Dijkstra's Single Source Shortest Path Algorithm. Edsger Wybe Dijkstra 2022: 21-26 - [i58]Jakob Bæk Tejs Houen, Mikkel Thorup:
Understanding the Moments of Tabulation Hashing via Chaoses. CoRR abs/2205.01453 (2022) - [i57]Rasmus Pagh, Mikkel Thorup:
Improved Utility Analysis of Private CountSketch. CoRR abs/2205.08397 (2022) - 2021
- [j76]On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup:
Compact cactus representations of all non-trivial min-cuts. Discret. Appl. Math. 303: 296-304 (2021) - [c139]Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS 2021: 468-479 - [c138]Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup:
Load balancing with dynamic set of balls and bins. STOC 2021: 1262-1275 - [i56]Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup:
Load Balancing with Dynamic Set of Balls and Bins. CoRR abs/2104.05093 (2021) - [i55]Jakub Tetek, Mikkel Thorup:
Sampling and Counting Edges via Vertex Accesses. CoRR abs/2107.03821 (2021) - [i54]Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. CoRR abs/2110.02807 (2021) - [i53]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR abs/2111.09376 (2021) - 2020
- [j75]Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup:
Disks in Curves of Bounded Convex Curvature. Am. Math. Mon. 127(7): 579-593 (2020) - [c137]Tobias Christiani, Rasmus Pagh, Mikkel Thorup:
Confirmation Sampling for Exact Nearest Neighbor Search. SISAP 2020: 97-110 - [c136]Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup:
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. SODA 2020: 1260-1279 - [c135]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup:
Fast hashing with strong concentration bounds. STOC 2020: 1265-1278 - [c134]Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup:
Three-in-a-tree in near linear time. STOC 2020: 1279-1292 - [i52]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast Streaming with Highly Concentrated Hashing. CoRR abs/2004.01156 (2020) - [i51]Thomas Dybdahl Ahle, Jakob Bæk Tejs Knudsen, Mikkel Thorup:
The Power of Hashing with Mersenne Primes. CoRR abs/2008.08654 (2020)
2010 – 2019
- 2019
- [j74]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup:
Heavy hitters via cluster-preserving clustering. Commun. ACM 62(8): 95-100 (2019) - [j73]Ken-ichi Kawarabayashi, Mikkel Thorup:
Deterministic Edge Connectivity in Near-Linear Time. J. ACM 66(1): 4:1-4:50 (2019) - [j72]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33(1): 116-137 (2019) - [c133]Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup:
Hardness of Bichromatic Closest Pair with Jaccard Similarity. ESA 2019: 74:1-74:13 - [c132]Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS 2019: 896-909 - [c131]Mikkel Thorup, Or Zamir, Uri Zwick:
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP 2019: 95:1-95:13 - [c130]Anders Aamand, Mikkel Thorup:
Non-empty Bins with Simple Tabulation Hashing. SODA 2019: 2498-2512 - [i50]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
Fast hashing with Strong Concentration Bounds. CoRR abs/1905.00369 (2019) - [i49]Rasmus Pagh, Nina Stausholm, Mikkel Thorup:
Hardness of Bichromatic Closest Pair with Jaccard Similarity. CoRR abs/1907.02251 (2019) - [i48]Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup:
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. CoRR abs/1909.00844 (2019) - [i47]Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup:
Disks in Curves of Bounded Convex Curvature. CoRR abs/1909.00852 (2019) - [i46]Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup:
Three-in-a-Tree in Near Linear Time. CoRR abs/1909.07446 (2019) - [i45]Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR abs/1909.11147 (2019) - 2018
- [j71]Mikkel Thorup:
Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8. SIAM J. Comput. 47(6): 2510-2526 (2018) - [j70]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ACM Trans. Algorithms 14(2): 17:1-17:21 (2018) - [c129]Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Power of d Choices with Simple Tabulation. ICALP 2018: 5:1-5:14 - [c128]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. MobiHoc 2018: 221-230 - [c127]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in Õ(log2 n) Amortized Time. SODA 2018: 35-52 - [c126]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. SODA 2018: 587-604 - [c125]Mathias Bæk Tejs Knudsen, Mikkel Thorup:
The Entropy of Backwards Analysis. SODA 2018: 867-880 - [c124]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast fencing. STOC 2018: 564-573 - [e1]Mikkel Thorup:
59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018. IEEE Computer Society 2018, ISBN 978-1-5386-4230-6 [contents] - [i44]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast Fencing. CoRR abs/1804.00101 (2018) - [i43]Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Power of d Choices with Simple Tabulation. CoRR abs/1804.09684 (2018) - [i42]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. CoRR abs/1805.06420 (2018) - [i41]On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup:
Contraction-Based Sparsification in Near-Linear Time. CoRR abs/1810.03865 (2018) - [i40]Anders Aamand, Mikkel Thorup:
Non-Empty Bins with Simple Tabulation Hashing. CoRR abs/1810.13187 (2018) - [i39]Tobias Christiani, Rasmus Pagh, Mikkel Thorup:
Confirmation Sampling for Exact Nearest Neighbor Search. CoRR abs/1812.02603 (2018) - 2017
- [j69]Mikkel Thorup:
Fast and powerful hashing using tabulation. Commun. ACM 60(7): 94-101 (2017) - [j68]Ken-ichi Kawarabayashi, Mikkel Thorup:
Coloring 3-Colorable Graphs with Less than n1/5 Colors. J. ACM 64(1): 4:1-4:23 (2017) - [c123]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Fast Similarity Sketching. FOCS 2017: 663-671 - [c122]Mikkel Thorup:
Fast and Powerful Hashing using Tabulation. FOGA 2017: 1 - [c121]Mikkel Thorup:
Fast and Powerful Hashing Using Tabulation (Invited Talk). ICALP 2017: 4:1-4:2 - [c120]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. NIPS 2017: 6615-6625 - [i38]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Fast Similarity Sketching. CoRR abs/1704.04370 (2017) - [i37]Mathias Bæk Tejs Knudsen, Mikkel Thorup:
The Entropy of Backwards Analysis. CoRR abs/1704.04509 (2017) - [i36]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time. CoRR abs/1707.06311 (2017) - [i35]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. CoRR abs/1711.08797 (2017) - 2016
- [j67]Mihai Patrascu, Mikkel Thorup:
On the k-Independence Required by Linear Probing and Minwise Independence. ACM Trans. Algorithms 12(1): 8:1-8:27 (2016) - [c119]Mikkel Abrahamsen, Mikkel Thorup:
Finding the Maximum Subset with Bounded Convex Curvature. SoCG 2016: 4:1-4:17 - [c118]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ESA 2016: 46:1-46:17 - [c117]Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Faster Worst Case Deterministic Dynamic Connectivity. ESA 2016: 53:1-53:15 - [c116]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup:
Heavy Hitters via Cluster-Preserving Clustering. FOCS 2016: 61-70 - [c115]Mikkel Thorup:
Fast and Powerful Hashing Using Tabulation (Invited Talk). FSTTCS 2016: 1:1-1:2 - [c114]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
The Power of Two Choices with Simple Tabulation. SODA 2016: 1631-1642 - [c113]Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick:
Bottleneck Paths and Trees and Deterministic Graphical Games. STACS 2016: 27:1-27:13 - [i34]Mikkel Abrahamsen, Mikkel Thorup:
Finding the Maximum Subset with Bounded Convex Curvature. CoRR abs/1603.02080 (2016) - [i33]Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup:
Heavy hitters via cluster-preserving clustering. CoRR abs/1604.01357 (2016) - [i32]Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam:
Consistent Hashing with Bounded Loads. CoRR abs/1608.01350 (2016) - [i31]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. CoRR abs/1611.06500 (2016) - 2015
- [j66]Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. Algorithmica 73(4): 623-636 (2015) - [c112]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Planar Reachability in Linear Space and Constant Time. FOCS 2015: 370-389 - [c111]Mikkel Thorup:
Sample (x) = (a*x<=t) is a Distinguisher with Probability 1/8. FOCS 2015: 1277-1291 - [c110]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
Hashing for Statistics over K-Partitions. FOCS 2015: 1292-1310 - [c109]Valerie King, Shay Kutten, Mikkel Thorup:
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication. PODC 2015: 71-80 - [c108]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC 2015: 625-634 - [c107]Ken-ichi Kawarabayashi, Mikkel Thorup:
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. STOC 2015: 665-674 - [c106]Tobias Christiani, Rasmus Pagh, Mikkel Thorup:
From Independence to Expansion and Back Again. STOC 2015: 813-820 - [i30]Valerie King, Shay Kutten, Mikkel Thorup:
Construction and impromptu repair of an MST in a distributed network with o(m) communication. CoRR abs/1502.03320 (2015) - [i29]Mikkel Thorup:
High Speed Hashing for Integers and Strings. CoRR abs/1504.06804 (2015) - [i28]Mikkel Thorup:
Fast and Powerful Hashing using Tabulation. CoRR abs/1505.01523 (2015) - [i27]Tobias Christiani, Rasmus Pagh, Mikkel Thorup:
From Independence to Expansion and Back Again. CoRR abs/1506.03676 (2015) - [i26]Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. CoRR abs/1507.05944 (2015) - [i25]Mikkel Thorup:
Linear Probing with 5-Independent Hashing. CoRR abs/1509.04549 (2015) - 2014
- [j65]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. 80(7): 1214-1244 (2014) - [j64]Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick:
Union-Find with Constant Time Deletions. ACM Trans. Algorithms 11(1): 6:1-6:28 (2014) - [c105]Mihai Patrascu, Mikkel Thorup:
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. FOCS 2014: 166-175 - [c104]Ken-ichi Kawarabayashi, Mikkel Thorup:
Coloring 3-colorable graphs with o(n^{1/5}) colors. STACS 2014: 458-469 - [c103]Søren Dahlgaard, Mikkel Thorup:
Approximately Minwise Independence with Twisted Tabulation. SWAT 2014: 134-145 - [i24]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency labeling schemes and induced-universal graphs. CoRR abs/1404.3391 (2014) - [i23]Søren Dahlgaard, Mikkel Thorup:
Approximately Minwise Independence with Twisted Tabulation. CoRR abs/1404.6724 (2014) - [i22]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
The Power of Two Choices with Simple Tabulation. CoRR abs/1407.6846 (2014) - [i21]Mihai Patrascu, Mikkel Thorup:
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. CoRR abs/1408.3045 (2014) - [i20]Mikkel Thorup:
Sample(x)=(a*x<=t) is a distinguisher with probability 1/8. CoRR abs/1411.4982 (2014) - [i19]Ken-ichi Kawarabayashi, Mikkel Thorup:
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time. CoRR abs/1411.5123 (2014) - [i18]Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Planar Reachability in Linear Space and Constant Time. CoRR abs/1411.5867 (2014) - [i17]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup:
Hashing for statistics over k-partitions. CoRR abs/1411.7191 (2014) - 2013
- [j63]Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit:
Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. 204(1): 65-95 (2013) - [j62]Mikkel Thorup:
Funding successful research. Commun. ACM 56(3): 38-39 (2013) - [j61]Mikkel Thorup:
Mihai Patrascu: Obituary and Open Problems. Bull. EATCS 109: 7-13 (2013) - [j60]Mikkel Thorup:
Mihai Pǎtraşcu: obituary and open problems. SIGACT News 44(1): 110-114 (2013) - [c102]Søren Dahlgaard, Christian Igel, Mikkel Thorup:
Nearest neighbor classification using bottom-k sketches. IEEE BigData 2013: 28-34 - [c101]Mikkel Thorup:
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. FOCS 2013: 90-99 - [c100]Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. ISAAC 2013: 491-501 - [c99]Mihai Patrascu, Mikkel Thorup:
Twisted Tabulation Hashing. SODA 2013: 209-228 - [c98]Ken-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup:
More Compact Oracles for Approximate Distances in Undirected Planar Graphs. SODA 2013: 550-563 - [c97]Mikkel Thorup:
Bottom-k and priority sampling, set similarity and subset sums with minimal independence. STOC 2013: 371-380 - [i16]Mikkel Thorup:
On the k-Independence Required by Linear Probing and Minwise Independence. CoRR abs/1302.5127 (2013) - [i15]Mikkel Thorup:
Bottom-k and Priority Sampling, Set Similarity and Subset Sums with Minimal Independence. CoRR abs/1303.5479 (2013) - [i14]Mikkel Thorup:
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. CoRR abs/1311.3121 (2013) - [i13]Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. CoRR abs/1312.2018 (2013) - 2012
- [j59]Mihai Patrascu, Mikkel Thorup:
The Power of Simple Tabulation Hashing. J. ACM 59(3): 14:1-14:50 (2012) - [j58]Mikkel Thorup, Yin Zhang:
Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation. SIAM J. Comput. 41(2): 293-331 (2012) - [c96]Ken-ichi Kawarabayashi, Mikkel Thorup:
Combinatorial Coloring of 3-Colorable Graphs. FOCS 2012: 68-75 - [c95]Mihai Patrascu, Liam Roditty, Mikkel Thorup:
A New Infinity of Distance Oracles for Sparse Graphs. FOCS 2012: 738-747 - [i12]Ken-ichi Kawarabayashi, Mikkel Thorup:
Combinatorial coloring of 3-colorable graphs. CoRR abs/1205.1254 (2012) - 2011
- [j57]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. 40(5): 1402-1431 (2011) - [c94]Ken-ichi Kawarabayashi, Mikkel Thorup:
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable. FOCS 2011: 160-169 - [c93]Mikkel Thorup:
Timeouts with time-reversed linear probing. INFOCOM 2011: 166-170 - [c92]Mihai Patrascu, Mikkel Thorup:
The power of simple tabulation hashing. STOC 2011: 1-10 - [c91]Mihai Patrascu, Mikkel Thorup:
Don't rush into a union: take time to find your roots. STOC 2011: 559-568 - [i11]Ken-ichi Kawarabayashi, Mikkel Thorup:
Minimum k-way cut of bounded size is fixed-parameter tractable. CoRR abs/1101.4689 (2011) - [i10]Mihai Patrascu, Mikkel Thorup:
Don't Rush into a Union: Take Time to Find Your Roots. CoRR abs/1102.1783 (2011) - 2010
- [j56]Omid Madani, Mikkel Thorup, Uri Zwick:
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. ACM Trans. Algorithms 6(2): 33:1-33:25 (2010) - [c90]Mikkel Thorup, Yin Zhang:
Tabulation Based 5-Universal Hashing and Linear Probing. ALENEX 2010: 62-76 - [c89]Mihai Patrascu, Mikkel Thorup:
On the k-Independence Required by Linear Probing and Minwise Independence. ICALP (1) 2010: 715-726 - [c88]Philip Bille, Mikkel Thorup:
Regular Expression Matching with Multi-Strings and Intervals. SODA 2010: 1297-1308 - [c87]Yevgeniy Dodis, Mihai Patrascu, Mikkel Thorup:
Changing base without losing space. STOC 2010: 593-602 - [i9]Mihai Patrascu, Mikkel Thorup:
The Power of Simple Tabulation Hashing. CoRR abs/1011.5200 (2010)
2000 – 2009
- 2009
- [j55]Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit:
Intra-domain traffic engineering with shortest path routing protocols. 4OR 7(4): 301-335 (2009) - [j54]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. 2(1): 431-442 (2009) - [j53]Mihai Patrascu, Mikkel Thorup:
Higher Lower Bounds for Near-Neighbor and Further Rich Problems. SIAM J. Comput. 39(2): 730-741 (2009) - [j52]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum Overhang. Am. Math. Mon. 116(9): 763-787 (2009) - [c86]Philip Bille, Mikkel Thorup:
Faster Regular Expression Matching. ICALP (1) 2009: 171-182 - [c85]Mikkel Thorup:
String hashing for linear probing. SODA 2009: 655-664 - [c84]Omid Madani, Mikkel Thorup, Uri Zwick:
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. SODA 2009: 958-967 - [c83]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264 - 2008
- [j51]Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup:
Speeding Up Dynamic Shortest-Path Algorithms. INFORMS J. Comput. 20(2): 191-204 (2008) - [j50]Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran:
Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37(5): 1299-1318 (2008) - [j49]Liam Roditty, Mikkel Thorup, Uri Zwick:
Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4(3): 29:1-29:17 (2008) - [j48]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. ACM Trans. Algorithms 4(3): 37:1-37:12 (2008) - [c82]Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS 2008: 109-120 - [c81]Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick:
Maximum overhang. SODA 2008: 756-765 - [c80]Mikkel Thorup:
Minimum k-way cuts via deterministic greedy tree packing. STOC 2008: 159-166 - [i8]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Variance optimal sampling based estimation of subset sums. CoRR abs/0803.0473 (2008) - 2007
- [j47]Mikkel Thorup:
Fully-Dynamic Min-Cut. Comb. 27(1): 91-127 (2007) - [j46]Arne Andersson, Mikkel Thorup:
Dynamic ordered sets with exponential search trees. J. ACM 54(3): 13 (2007) - [j45]Mikkel Thorup:
Equivalence between priority queues and sorting. J. ACM 54(6): 28 (2007) - [j44]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Priority sampling for estimation of arbitrary subset sums. J. ACM 54(6): 32 (2007) - [j43]Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup:
Survivable IP network design with OSPF routing. Networks 49(1): 51-64 (2007) - [c79]Mario Szegedy, Mikkel Thorup:
On the Variance of Subset Sum Estimation. ESA 2007: 75-86 - [c78]Mikkel Thorup:
Compact Oracles for Approximate Distances Around Obstacles in the Plane. ESA 2007: 383-394 - [c77]Mihai Patrascu, Mikkel Thorup:
Planning for Fast Connectivity Updates. FOCS 2007: 263-271 - [c76]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference 2007: 265-278 - [c75]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262 - [c74]Mihai Patrascu, Mikkel Thorup:
Randomization does not help searching predecessors. SODA 2007: 555-564 - [i7]Mario Szegedy, Mikkel Thorup:
On the variance of subset sum estimation. CoRR abs/cs/0702029 (2007) - 2006
- [j42]Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick:
Melding priority queues. ACM Trans. Algorithms 2(4): 535-556 (2006) - [c73]Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup:
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743 - [c72]Mihai Patrascu, Mikkel Thorup:
Higher Lower Bounds for Near-Neighbor and Further Rich Problems. FOCS 2006: 646-654 - [c71]Mikkel Thorup:
Confidence intervals for priority sampling. SIGMETRICS/Performance 2006: 252-263 - [c70]Mikkel Thorup, Uri Zwick:
Spanners and emulators with sublinear distance errors. SODA 2006: 802-809 - [c69]Mihai Patrascu, Mikkel Thorup:
Time-space trade-offs for predecessor search. STOC 2006: 232-240 - [i6]Mihai Patrascu, Mikkel Thorup:
Time-Space Trade-Offs for Predecessor Search. CoRR abs/cs/0603043 (2006) - 2005
- [j41]Mikkel Thorup, Uri Zwick:
Approximate distance oracles. J. ACM 52(1): 1-24 (2005) - [j40]Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup:
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46(1): 36-56 (2005) - [j39]Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup:
Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms 1(1): 102-106 (2005) - [j38]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2): 243-264 (2005) - [j37]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Learn more, sample less: control of volume and variance in network measurement. IEEE Trans. Inf. Theory 51(5): 1756-1775 (2005) - [j36]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw. 13(5): 933-946 (2005) - [c68]Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick:
Union-Find with Constant Time Deletions. ICALP 2005: 78-89 - [c67]Liam Roditty, Mikkel Thorup, Uri Zwick:
Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP 2005: 261-272 - [c66]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Optimal Combination of Sampled Network Measurements. Internet Measurement Conference 2005: 91-104 - [c65]Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Estimating arbitrary subset sums with few probes. PODS 2005: 317-325 - [c64]Mikkel Thorup:
Worst-case update times for fully-dynamic all-pairs shortest paths. STOC 2005: 112-119 - [i5]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Sampling to estimate arbitrary subset sums. CoRR abs/cs/0509026 (2005) - 2004
- [j35]Bernard Fortz, Mikkel Thorup:
Increasing Internet Capacity Using Local Search. Comput. Optim. Appl. 29(1): 13-48 (2004) - [j34]Mikkel Thorup:
Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6): 993-1024 (2004) - [j33]Mikkel Thorup:
Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. Comput. Syst. Sci. 69(3): 330-353 (2004) - [j32]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res. 29(3): 436-461 (2004) - [j31]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup:
OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33(3): 632-646 (2004) - [j30]Mikkel Thorup:
Quick k-Median, k-Center, and Facility Location for Sparse Graphs. SIAM J. Comput. 34(2): 405-432 (2004) - [c63]Anna Pagh, Rasmus Pagh, Mikkel Thorup:
On Adaptive Integer Sorting. ESA 2004: 556-579 - [c62]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Flow sampling under hard resource constraints. SIGMETRICS 2004: 85-96 - [c61]Ran Mendelson, Mikkel Thorup, Uri Zwick:
Meldable RAM priority queues and minimum directed spanning trees. SODA 2004: 40-48 - [c60]Mikkel Thorup, Yin Zhang:
Tabulation based 4-universal hashing with applications to second moment estimation. SODA 2004: 615-624 - [c59]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. SPAA 2004: 20-24 - [c58]Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick:
Melding Priority Queues. SWAT 2004: 223-235 - [c57]Mikkel Thorup:
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. SWAT 2004: 384-396 - 2003
- [j29]Mikkel Thorup:
Combinatorial power in multimedia processors. SIGARCH Comput. Archit. News 31(4): 5-11 (2003) - [j28]Matthew H. Austern, Bjarne Stroustrup, Mikkel Thorup, John Wilkinson:
Untangling the balancing and searching of balanced binary search trees. Softw. Pract. Exp. 33(13): 1273-1298 (2003) - [c56]Matthew Roughan, Mikkel Thorup, Yin Zhang:
Traffic engineering with estimated traffic matrices. Internet Measurement Conference 2003: 248-258 - [c55]David L. Applegate, Mikkel Thorup:
Load optimal MPLS routing with N+M labels. INFOCOM 2003: 555-565 - [c54]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Estimating flow distributions from sampled flow statistics. SIGCOMM 2003: 325-336 - [c53]Matthew Roughan, Mikkel Thorup, Yin Zhang:
Performance of estimated traffic matrices in traffic engineering. SIGMETRICS 2003: 326-327 - [c52]Mikkel Thorup:
Quick and good facility location. SODA 2003: 178-185 - [c51]Mikkel Thorup:
On AC0 implementations of fusion trees and atomic heaps. SODA 2003: 699-707 - [c50]Anupam Gupta, Amit Kumar, Mikkel Thorup:
Tree based MPLS routing. SPAA 2003: 193-199 - [c49]Mikkel Thorup:
Integer priority queues with decrease key in constant time and the single source shortest paths problem. STOC 2003: 149-158 - [c48]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup:
OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564 - [c47]Mikkel Thorup:
Space efficient dynamic stabbing with fast queries. STOC 2003: 649-658 - [i4]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining Information in Fully-Dynamic Trees with Top Trees. CoRR cs.DS/0310065 (2003) - 2002
- [j27]Bernard Fortz, Jennifer Rexford, Mikkel Thorup:
Traffic engineering with traditional IP routing protocols. IEEE Commun. Mag. 40(10): 118-124 (2002) - [j26]Mikkel Thorup:
Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. J. Algorithms 42(2): 205-230 (2002) - [j25]Bernard Fortz, Mikkel Thorup:
Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Sel. Areas Commun. 20(4): 756-767 (2002) - [c46]Mikkel Thorup:
On Distance Oracles and Routing in Graphs. ESA 2002: 4 - [c45]Mikkel Thorup:
Equivalence between Priority Queues and Sorting. FOCS 2002: 125-134 - [c44]Yijie Han, Mikkel Thorup:
Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. FOCS 2002: 135-144 - [c43]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Properties and prediction of flow statistics from sampled packet streams. Internet Measurement Workshop 2002: 159-171 - [c42]Camil Demetrescu, Mikkel Thorup:
Oracles for distances avoiding a link-failure. SODA 2002: 838-843 - [c41]Liam Roditty, Mikkel Thorup, Uri Zwick:
Roundtrip spanners and roundtrip routing in directed graphs. SODA 2002: 844-851 - [i3]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. CoRR cs.DS/0205051 (2002) - [i2]Arne Andersson, Mikkel Thorup:
Dynamic Ordered Sets with Exponential Search Trees. CoRR cs.DS/0210006 (2002) - [i1]Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup:
Efficient Tree Layout in a Multilevel Memory Hierarchy. CoRR cs.DS/0211010 (2002) - 2001
- [j24]Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4): 723-760 (2001) - [j23]Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup:
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. ACM J. Exp. Algorithmics 6: 4 (2001) - [c40]Valerie King, Mikkel Thorup:
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. COCOON 2001: 268-277 - [c39]Mikkel Thorup:
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. FOCS 2001: 242-251 - [c38]Mikkel Thorup:
Quick k-Median, k-Center, and Facility Location for Sparse Graphs. ICALP 2001: 249-260 - [c37]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Charging from sampled network usage. Internet Measurement Workshop 2001: 245-256 - [c36]Arne Andersson, Mikkel Thorup:
Dynamic string searching. SODA 2001: 307-308 - [c35]Mikkel Thorup, Uri Zwick:
Compact routing schemes. SPAA 2001: 1-10 - [c34]Mikkel Thorup, Uri Zwick:
Approximate distance oracles. STOC 2001: 183-192 - [c33]Mikkel Thorup:
Fully-dynamic min-cut. STOC 2001: 224-230 - 2000
- [j22]Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
Generalized Dominators for Structured Programs. Algorithmica 27(3): 244-253 (2000) - [j21]Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. J. Algorithms 35(2): 169-188 (2000) - [j20]Mikkel Thorup:
Floats, Integers, and Single Source Shortest Paths. J. Algorithms 35(2): 189-201 (2000) - [j19]Mikkel Thorup:
On RAM Priority Queues. SIAM J. Comput. 30(1): 86-109 (2000) - [j18]Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup:
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput. 30(5): 1385-1404 (2000) - [c32]Bernard Fortz, Mikkel Thorup:
Internet Traffic Engineering by Optimizing OSPF Weights. INFOCOM 2000: 519-528 - [c31]Mikkel Thorup:
Even strongly universal hashing is pretty fast. SODA 2000: 496-497 - [c30]Stephen Alstrup, Jens P. Secher, Mikkel Thorup:
Word encoding tree connectivity works. SODA 2000: 498-499 - [c29]Arne Andersson, Mikkel Thorup:
Tight(er) worst-case bounds on dynamic searching and priority queues. STOC 2000: 335-342 - [c28]Mikkel Thorup:
Near-optimal fully-dynamic graph connectivity. STOC 2000: 343-350 - [c27]Mikkel Thorup, David R. Karger:
Dynamic Graph Algorithms with Applications. SWAT 2000: 1-9 - [c26]Stephen Alstrup, Jacob Holm, Mikkel Thorup:
Maintaining Center and Median in Dynamic Trees. SWAT 2000: 46-56
1990 – 1999
- 1999
- [j17]Mikkel Thorup:
Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. ACM 46(3): 362-394 (1999) - [j16]Mikkel Thorup:
Decremental Dynamic Connectivity. J. Algorithms 33(2): 229-243 (1999) - [j15]Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup:
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SIAM J. Comput. 28(3): 1073-1085 (1999) - [j14]Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup:
Dominators in Linear Time. SIAM J. Comput. 28(6): 2117-2132 (1999) - [j13]Arne Andersson, Peter Bro Miltersen, Mikkel Thorup:
Fusion Trees can be Implemented with AC0 Instructions Only. Theor. Comput. Sci. 215(1-2): 337-344 (1999) - [c25]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. STOC 1999: 668-678 - 1998
- [j12]Martin Farach, Mikkel Thorup:
String Matching in Lempel-Ziv Compressed Strings. Algorithmica 20(4): 388-404 (1998) - [j11]Mikkel Thorup:
All Structured Programs have Small Tree-Width and Good Register Allocation. Inf. Comput. 142(2): 159-181 (1998) - [c24]Mikkel Thorup:
Map Graphs in Polynomial Time. FOCS 1998: 396-405 - [c23]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Direct Routing on Trees (Extended Abstract). SODA 1998: 342-349 - [c22]Mikkel Thorup:
Faster Deterministic Sorting and Priority Queues in Linear Space. SODA 1998: 550-555 - [c21]Mikkel Thorup:
Floats, Integers, and Single Source Shortest Paths. STACS 1998: 14-24 - [c20]Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. STOC 1998: 79-89 - 1997
- [j10]Mikkel Thorup:
Parallel Shortcutting of Rooted Trees. J. Algorithms 23(1): 139-159 (1997) - [j9]Monika Rauch Henzinger, Mikkel Thorup:
Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Struct. Algorithms 11(4): 369-379 (1997) - [j8]Martin Farach, Mikkel Thorup:
Sparse Dynamic Programming for Evolutionary-Tree Comparison. SIAM J. Comput. 26(1): 210-230 (1997) - [c19]Mikkel Thorup:
Undirected Single Source Shortest Path in Linear Time. FOCS 1997: 12-21 - [c18]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Minimizing Diameters of Dynamic Trees. ICALP 1997: 270-280 - [c17]Mikkel Thorup:
Decremental Dynamic Connectivity. SODA 1997: 305-313 - [c16]Mikkel Thorup:
Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. SODA 1997: 352-359 - [c15]Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup:
Finding Cores of Limited Length. WADS 1997: 45-54 - [c14]Mikkel Thorup:
Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). WG 1997: 318-332 - 1996
- [j7]Mikkel Thorup:
Disambiguating Grammars by Exclusion of Sub-Parse Trees. Acta Informatica 33(6): 511-522 (1996) - [j6]Mikkel Thorup:
Efficient Preprocessing of Simple Binay Pattern Forests. J. Algorithms 20(3): 602-612 (1996) - [c13]Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup:
Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. FOCS 1996: 441-450 - [c12]Monika Rauch Henzinger, Mikkel Thorup:
Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP 1996: 290-299 - [c11]Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
Generalized Dominators for Structured Programs. SAS 1996: 42-51 - [c10]Mikkel Thorup:
On RAM Priority Queues. SODA 1996: 59-67 - [c9]Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup:
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SODA 1996: 365-372 - [c8]Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. SWAT 1996: 212-222 - 1995
- [j5]Mikkel Thorup:
Shortcutting Planar Digraphs. Comb. Probab. Comput. 4: 287-315 (1995) - [j4]Martin Farach, Mikkel Thorup:
Fast Comparison of Evolutionary Trees. Inf. Comput. 123(1): 29-37 (1995) - [j3]Martin Farach, Teresa M. Przytycka, Mikkel Thorup:
On the Agreement of Many Trees. Inf. Process. Lett. 55(6): 297-301 (1995) - [c7]Martin Farach, Teresa M. Przytycka, Mikkel Thorup:
Computing the Agreement of Trees with Bounded Degrees. ESA 1995: 381-393 - [c6]Martin Farach, Mikkel Thorup:
String matching in Lempel-Ziv compressed strings. STOC 1995: 703-712 - 1994
- [j2]Mikkel Thorup:
Controlled Grammatic Ambiguity. ACM Trans. Program. Lang. Syst. 16(3): 1024-1050 (1994) - [c5]Martin Farach, Mikkel Thorup:
Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract). FOCS 1994: 770-779 - [c4]Martin Farach, Mikkel Thorup:
Fast Comparison of Evolutionary Trees. SODA 1994: 481-488 - [c3]Mikkel Thorup:
Efficient Preprocessing of Simple Binary Pattern Forests. SWAT 1994: 350-358 - 1992
- [c2]Mikkel Thorup:
On Shortcutting Digraphs. WG 1992: 205-211 - 1991
- [j1]Andrzej Blikle, Andrzej Tarlecki, Mikkel Thorup:
On Conservative Extensions of Syntax in System Development. Theor. Comput. Sci. 90(1): 209-233 (1991) - 1990
- [c1]Andrzej Blikle, Mikkel Thorup:
On Conservative Extensions of Syntax in the Process of System Development. VDM Europe 1990: 504-525
Coauthor Index
Martin Farach-Colton
aka: Martin Farach
aka: Martin Farach
Jakob Bæk Tejs Houen
aka: Jakob Bæk Tejs Knudsen
aka: Jakob Bæk Tejs Knudsen
Peter M. R. Rasmussen
aka: Peter Michael Reichstein Rasmussen
aka: Peter Michael Reichstein Rasmussen
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
