No. Title Author Year
1 Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps Thorup, Mikkel et al. 2019
2 Hardness of Bichromatic Closest Pair with Jaccard Similarity Pagh, Rasmus et al. 2019
3 Power of d Choices with Simple Tabulation Aamand, Anders et al. 2018
4 Fast and Powerful Hashing Using Tabulation (Invited Talk) Thorup, Mikkel 2017
5 Bottleneck Paths and Trees and Deterministic Graphical Games Chechik, Shiri et al. 2016
6 Fast and Powerful Hashing Using Tabulation (Invited Talk) Thorup, Mikkel 2016
7 Faster Worst Case Deterministic Dynamic Connectivity Kejlberg-Rasmussen, Casper et al. 2016
8 Finding the Maximum Subset with Bounded Convex Curvature Abrahamsen, Mikkel et al. 2016
9 Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time Goranci, Gramoz et al. 2016
10 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: 10


DROPS-Home | Imprint | Privacy Published by LZI