Mikkel Thorup

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 106

Top Venues

Publications

Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
Better coloring of 3-colorable graphs. CoRR (2024)
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) (2024)
Wenyu Jin, Xiaorui Sun, Mikkel Thorup
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. CoRR (2024)
Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang
Combinatorial Correlation Clustering. CoRR (2024)
Wenyu Jin, Xiaorui Sun, Mikkel Thorup
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. SODA (2024)
Ken-ichi Kawarabayashi, Mikkel Thorup, Hirotaka Yoneda
Better Coloring of 3-Colorable Graphs. STOC (2024)
Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang
Combinatorial Correlation Clustering. STOC (2024)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. SOSA (2024)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. CoRR (2024)
Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup
Locally Uniform Hashing. FOCS (2023)
Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. CoRR (2023)
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) (2023)
Jakob Bæk Tejs Houen, Mikkel Thorup
A Sparse Johnson-Lindenstrauss Transform using Fast Hashing. CoRR (2023)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP (2023)
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
) Amortized Expected Time. TheoretiCS 2 (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA (2023)
Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. FOCS (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR (2023)
Jakob Bæk Tejs Houen, Mikkel Thorup
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing. ICALP (2023)
Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup
Locally Uniform Hashing. CoRR (2023)
Mikkel Abrahamsen, Mikkel Thorup
How to Cut Corners and Get Bounded Convex Curvature. Discret. Comput. Geom. 69 (4) (2023)
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) (2022)
Jakob Bæk Tejs Houen, Mikkel Thorup
Understanding the Moments of Tabulation Hashing via Chaoses. CoRR (2022)
Rasmus Pagh, Mikkel Thorup
Improved Utility Analysis of Private CountSketch. CoRR (2022)
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 (2022)
Rasmus Pagh, Mikkel Thorup
Improved Utility Analysis of Private CountSketch. NeurIPS (2022)
Jakub Tetek, Mikkel Thorup
Edge sampling and graph parameter estimation via vertex neighborhood accesses. STOC (2022)
Jakob Bæk Tejs Houen, Mikkel Thorup
Understanding the Moments of Tabulation Hashing via Chaoses. ICALP (2022)
Mikkel Thorup
Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper). SWAT (2022)
Jakub Tetek, Mikkel Thorup
Sampling and Counting Edges via Vertex Accesses. CoRR (2021)
Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup
Load Balancing with Dynamic Set of Balls and Bins. CoRR (2021)
Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup
Load balancing with dynamic set of balls and bins. STOC (2021)
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 (2021)
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)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR (2021)
On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
Compact cactus representations of all non-trivial min-cuts. Discret. Appl. Math. 303 (2021)
Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup
Disks in Curves of Bounded Convex Curvature. Am. Math. Mon. 127 (7) (2020)
Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup
Three-in-a-tree in near linear time. STOC (2020)
Thomas Dybdahl Ahle, Jakob Bæk Tejs Knudsen, Mikkel Thorup
The Power of Hashing with Mersenne Primes. CoRR (2020)
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)
Tobias Christiani, Rasmus Pagh, Mikkel Thorup
Confirmation Sampling for Exact Nearest Neighbor Search. SISAP (2020)
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. SODA (2020)
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 (2020)
Anders Aamand, Mikkel Thorup
Non-empty Bins with Simple Tabulation Hashing. SODA (2019)
Mikkel Thorup, Or Zamir, Uri Zwick
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP (2019)
Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR (2019)
Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
Heavy hitters via cluster-preserving clustering. Commun. ACM 62 (8) (2019)
Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS (2019)
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 (2019)
Rasmus Pagh, Nina Stausholm, Mikkel Thorup
Hardness of Bichromatic Closest Pair with Jaccard Similarity. CoRR (2019)
Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup
Disks in Curves of Bounded Convex Curvature. CoRR (2019)
Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup
Hardness of Bichromatic Closest Pair with Jaccard Similarity. ESA (2019)
Ken-ichi Kawarabayashi, Mikkel Thorup
Deterministic Edge Connectivity in Near-Linear Time. J. ACM 66 (1) (2019)
Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup
Three-in-a-Tree in Near Linear Time. CoRR (2019)
Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33 (1) (2019)
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. CoRR (2019)
Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
Fast Fencing. CoRR (2018)
Anders Aamand, Mikkel Thorup
Non-Empty Bins with Simple Tabulation Hashing. CoRR (2018)
Jacob Holm, Eva Rotenberg, Mikkel Thorup
) Amortized Time. SODA (2018)
Tobias Christiani, Rasmus Pagh, Mikkel Thorup
Confirmation Sampling for Exact Nearest Neighbor Search. CoRR (2018)
Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Power of d Choices with Simple Tabulation. ICALP (2018)
Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Power of d Choices with Simple Tabulation. CoRR (2018)
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ACM Trans. Algorithms 14 (2) (2018)
Mikkel Thorup
Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8. SIAM J. Comput. 47 (6) (2018)
Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup
Fast fencing. STOC (2018)
Mathias Bæk Tejs Knudsen, Mikkel Thorup
The Entropy of Backwards Analysis. SODA (2018)
On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
Contraction-Based Sparsification in Near-Linear Time. CoRR (2018)
David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang
Wireless coverage prediction via parametric shortest paths. CoRR (2018)
Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
Consistent Hashing with Bounded Loads. SODA (2018)
David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang
Wireless coverage prediction via parametric shortest paths. MobiHoc (2018)
Mikkel Thorup
Fast and powerful hashing using tabulation. Commun. ACM 60 (7) (2017)
Mikkel Thorup
Fast and Powerful Hashing using Tabulation. FOGA (2017)
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. NIPS (2017)
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Practical Hash Functions for Similarity Estimation and Dimensionality Reduction. CoRR (2017)
Jacob Holm, Eva Rotenberg, Mikkel Thorup
Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time. CoRR (2017)
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Fast Similarity Sketching. CoRR (2017)
Mikkel Thorup
Fast and Powerful Hashing Using Tabulation (Invited Talk). ICALP (2017)
Mathias Bæk Tejs Knudsen, Mikkel Thorup
The Entropy of Backwards Analysis. CoRR (2017)
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Mikkel Thorup
Fast Similarity Sketching. FOCS (2017)
Ken-ichi Kawarabayashi, Mikkel Thorup
Colors. J. ACM 64 (1) (2017)
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
The Power of Two Choices with Simple Tabulation. SODA (2016)
Mikkel Thorup
Fast and Powerful Hashing Using Tabulation (Invited Talk). FSTTCS (2016)
Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
Consistent Hashing with Bounded Loads. CoRR (2016)
Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick
Bottleneck Paths and Trees and Deterministic Graphical Games. STACS (2016)
Mikkel Abrahamsen, Mikkel Thorup
Finding the Maximum Subset with Bounded Convex Curvature. SoCG (2016)
Mihai Patrascu, Mikkel Thorup
-Independence Required by Linear Probing and Minwise Independence. ACM Trans. Algorithms 12 (1) (2016)
Mikkel Abrahamsen, Mikkel Thorup
Finding the Maximum Subset with Bounded Convex Curvature. CoRR (2016)
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. CoRR (2016)
Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
Heavy hitters via cluster-preserving clustering. CoRR (2016)
Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
Heavy Hitters via Cluster-Preserving Clustering. FOCS (2016)
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ESA (2016)
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
Faster Worst Case Deterministic Dynamic Connectivity. ESA (2016)
Mikkel Thorup
Fast and Powerful Hashing using Tabulation. CoRR (2015)
Mikkel Thorup
Linear Probing with 5-Independent Hashing. CoRR (2015)
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
Hashing for Statistics over K-Partitions. FOCS (2015)
Valerie King, Shay Kutten, Mikkel Thorup
Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication. PODC (2015)
Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC (2015)
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. CoRR (2015)
Mikkel Thorup
Sample (x) = (a*x<=t) is a Distinguisher with Probability 1/8. FOCS (2015)
Jacob Holm, Eva Rotenberg, Mikkel Thorup
Planar Reachability in Linear Space and Constant Time. FOCS (2015)

Mikkel Thorup.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mikkel Thorup