max planck institut
informatik
informatik
MPI-I-98-1-001. January 1998, 13 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
We consider the static dictionary problem of using
$O(n)$ $w$-bit words to store $n$ $w$-bit keys for
fast retrieval on a $w$-bit \ACz\ RAM, i.e., on a
RAM with a word length of $w$ bits whose
instruction set is arbitrary, except that each instruction
must be realizable through an unbounded-fanin circuit
of constant depth and $w^{O(1)}$ size, and that the
instruction set must be finite and independent of the
keys stored.
We improve the best known upper bounds
for moderate values of~$w$ relative to $n$.
If ${w/{\log n}}=(\log\log n)^{O(1)}$,
query time $(\log\log\log n)^{O(1)}$ is achieved, and if
additionally ${w/{\log n}}\ge(\log\log n)^{1+\epsilon}$
for some fixed $\epsilon>0$, the query time
is constant.
For both of these special cases, the best previous
upper bound was $O(\log\log n)$.
Acknowledgement:
References to related material:
| To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
|---|---|
| 179 KBytes | |
| Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView | |
BibTeX