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)