A Trade-Off For Worst-Case Efficient Dictionaries

Cached

Download Links

by Rasmus Pagh
Citations:7 - 2 self

Documents Related by Co-Citation

149 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
39 János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time – Michael L Fredman - 1984
55 Optimal Bounds for the Predecessor Problem and Related Problems – Paul Beame, Faith E. Fich - 2001
34 Deterministic Dictionaries – Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh - 2001
43 Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues – Arne Andersson, Mikkel Thorup - 2000
52 A lower bound for finding predecessors in Yao’s cell probe model – M Ajtai - 1988
27 Lower bounds for predecessor searching in the cell probe model – Pranab Sen, et al. - 2008
106 Tradeoffs for Packet Classification – Anja Feldmann, S. Muthukrishnan
11 Worst case constant time priority queue – Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro - 2001
49 Lower bounds for Union-Split-Find related problems on random access machines – Peter Bro Miltersen - 1994
203 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977
172 Small forwarding tables for fast routing lookups – Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink - 1997
26 Dynamic Ordered Sets with Exponential Search Trees – Arne Andersson, Mikkel Thorup - 2001
6 Munro and Hendra Suwanda. Implicit data structures for fast search and update – J Ian - 1980
5 Fiat and Moni Naor. Implicit O(1) probe search – Amos - 1993
7 Stølting Brodal and Rolf Fagerberg. Dynamic representation of sparse graphs – Gerth - 1999
12 On the Probe Complexities of Membership and Perfect Hashing – Rasmus Pagh
17 Storing information with extractors – A Ta-Shma
308 On representatives of subsets – P Hall - 1935