The dictionary problem is among the oldest problems in computer science. Yet our understanding of the complexity of the dictionary problem in realistic models of computation has been far from complete. Designing highly efficient dictionaries without resorting to use of randomness appeared to be a particularly challenging task. We present solutions to the static dictionary problem that significantly improve the previously known upper bounds and bring them close to obvious lower bounds. Our dictionaries have a constant lookup cost and use linear space, which was known to be possible, but the worst-case cost of construction of the structures is proportional to only loglogn times the cost of sorting the input. Our claimed performance bounds are obtained in the word RAM model and in the external memory models; only the involved sorting procedures in the algorithms need to be changed between the models.
|Bogserie||Lecture Notes in Computer Science|
|Status||Udgivet - 2008|
|Begivenhed||ICALP 2008 35th International Colloquium on Automata, Languages and Programming - Reykjavik, Island|
Varighed: 6 jul. 2008 → 13 jul. 2008
Konferencens nummer: 35
|Konference||ICALP 2008 35th International Colloquium on Automata, Languages and Programming|
|Periode||06/07/2008 → 13/07/2008|