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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI