| No. |
Title |
Author |
Year |
| 1 |
A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing |
Houen, Jakob Bæk Tejs et al. |
2023 |
| 2 |
Optimal Decremental Connectivity in Non-Sparse Graphs |
Aamand, Anders et al. |
2023 |
| 3 |
Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper) |
Thorup, Mikkel |
2022 |
| 4 |
Understanding the Moments of Tabulation Hashing via Chaoses |
Houen, Jakob Bæk Tejs et al. |
2022 |
| 5 |
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps |
Thorup, Mikkel et al. |
2019 |
| 6 |
Hardness of Bichromatic Closest Pair with Jaccard Similarity |
Pagh, Rasmus et al. |
2019 |
| 7 |
Power of d Choices with Simple Tabulation |
Aamand, Anders et al. |
2018 |
| 8 |
Fast and Powerful Hashing Using Tabulation (Invited Talk) |
Thorup, Mikkel |
2017 |
| 9 |
Bottleneck Paths and Trees and Deterministic Graphical Games |
Chechik, Shiri et al. |
2016 |
| 10 |
Fast and Powerful Hashing Using Tabulation (Invited Talk) |
Thorup, Mikkel |
2016 |
| 11 |
Faster Worst Case Deterministic Dynamic Connectivity |
Kejlberg-Rasmussen, Casper et al. |
2016 |
| 12 |
Finding the Maximum Subset with Bounded Convex Curvature |
Abrahamsen, Mikkel et al. |
2016 |
| 13 |
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time |
Goranci, Gramoz et al. |
2016 |
| 14 |
Coloring 3-colorable graphs with o(n^{1/5}) colors |
Kawarabayashi, Ken-ichi et al. |
2014 |
