## Hashing, Randomness and Dictionaries (2002)

### Cached

### Download Links

by
Rasmus Pagh

Citations: | 3 - 0 self |

### BibTeX

@MISC{Pagh02hashing,randomness,

author = {Rasmus Pagh},

title = {Hashing, Randomness and Dictionaries},

year = {2002}

}

### OpenURL

### Abstract

This thesis is centered around one of the most basic information retrieval problems, namely that of storing and accessing the elements of a set. Each element in the set has some associated information that is returned along with it. The problem is referred to as the dictionary problem, due to the similarity to a bookshelf dictionary, which contains a set of words and has an explanation associated with each word. In the static version of the problem the set is fixed, whereas in the dynamic version, insertions and deletions of elements are possible. The approach