|
135
|
Surpassing the information theoretic bound with fusion trees
– M L Fredman, D E Willard
- 1993
|
|
44
|
Optimal Bounds for the Predecessor Problem and Related Problems
– Paul Beame, Faith E. Fich
- 2001
|
|
35
|
Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues
– Arne Andersson, Mikkel Thorup
- 2000
|
|
30
|
Deterministic Dictionaries
– Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh
- 2001
|
|
31
|
János Komlós, and Endre Szemerédi. Storing a sparse table with 0(1) worst case access time
– Michael L Fredman
- 1984
|
|
11
|
Worst case constant time priority queue
– Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro
- 2001
|
|
157
|
Small forwarding tables for fast routing lookups
– Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink
- 1997
|
|
99
|
Tradeoffs for Packet Classification
– Anja Feldmann, S. Muthukrishnan
- 2000
|
|
46
|
A lower bound for finding predecessors in Yao’s cell probe model
– Miklós Ajtai
- 1988
|
|
14
|
Dynamic ordered sets with exponential search trees
– Arne Andersson, Mikkel Thorup
- 2002
|
|
41
|
Lower bounds for Union-Split-Find related problems on random access machines
– Peter Bro Miltersen
- 1994
|
|
19
|
Lower bounds for predecessor searching in the cell probe model
– Pranab Sen, et al.
- 2008
|
|
182
|
Design and implementation of an efficient priority queue
– P van Emde Boas, R Kaas, E Zijlstra
- 1977
|
|
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
|
|
14
|
Storing information with extractors
– A Ta-Shma
|
|
57
|
Optimal Bounds for the Predecessor Problem
– Paul Beame, Faith E. Fich
|
|
120
|
Should tables be sorted
– Andrew Chi-chih Yao
- 1981
|
