Autor:	Janson, Svante, Viola, Alfredo
Rok vydání:	2014
Předmět:	Computer Science - Data Structures and Algorithms 60W40 68P10 68P20
Druh dokumentu:	Working Paper
Popis:	We give a unified analysis of linear probing hashing with a general bucket size. We use both a combinatorial approach, giving exact formulas for generating functions, and a probabilistic approach, giving simple derivations of asymptotic results. Both approaches complement nicely, and give a good insight in the relation between linear probing and random walks. A key methodological contribution, at the core of Analytic Combinatorics, is the use of the symbolic method (based on q-calculus) to directly derive the generating functions to analyze. Comment: 49 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1410.5967 Zobrazit plný text záznamu View this record from Arxiv