A Trade-Off For Worst-Case Efficient Dictionaries

Cached

Download Links

by Rasmus Pagh
Citations:7 - 2 self

Documents Related by Co-Citation

150 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
710 Universal classes of hash functions – J L Carter, M N Wegman - 1979
40 János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time – Michael L Fredman - 1984
561 The Input/Output complexity of sorting and related problems – A Aggarwal, J S Vitter - 1988
340 On representatives of subsets – E Hall - 1935
57 Optimal Bounds for the Predecessor Problem and Related Problems – Paul Beame, Faith E. Fich - 2001
41 Tight(er) worst-case bounds on dynamic searching and priority queues – A Andersson, M Thorup - 2000
36 Deterministic Dictionaries – Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh - 2001
201 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977