Random Graphs and Cuckoo Hashing

Recent advances in computer technology result in a steadily increasing amount of data. For more than 50 years, hash tables are used in computer science to build data structures that allow efficient search operations. Cuckoo hashing is a recently developed algorithm with very interesting worst case properties, that is analysed in detail in this book. The data structure is closely related to a special kind of random graph. Hence, it is possible to analyse its properties by studying the structure of these graphs. The calculations are based on generating functions and asymptotic methods. Although many calculations require detailed knowledge of advanced mathematics, some familiarity with data structures is sufficient to understand and apply the achieved results.

Autorentext

Reinhard Kutzelnigg: Study of Technical Mathematics, branchMathematical Computer Sciences, and PhD-studies in Mathematicscompleted in 2008 at Vienna University of Technology.