uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
The maximum displacement for linear probing hashing II
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.
(English)Manuscript (Other academic)
National Category
Natural Sciences
URN: urn:nbn:se:uu:diva-98028OAI: oai:DiVA.org:uu-98028DiVA: diva2:173188

See DiVA http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-98027 for a detailed, published record.

Available from: 2009-02-05 Created: 2009-02-05 Last updated: 2013-05-23Bibliographically approved
In thesis
1. The Maximum Displacement for Linear Probing Hashing
Open this publication in new window or tab >>The Maximum Displacement for Linear Probing Hashing
2009 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In this thesis we study the standard probabilistic model for hashing with linear probing. The main purpose is to determine the asymptotic distribution for the maximum displacement. Depending on the ratio between the number of items and the number of cells, there are several cases to consider. Paper I solves the problem for the special case of almost full hash tables. That is, hash tables where every cell but one is occupied. Paper II completes the analysis by solving the problem for all remaining cases. That is, for every case where the number of items divided by the number of cells lies in the interval [0,1].

The last two papers treat quite different topics. Paper III studies the area covered by the supremum process of Brownian motion. One of the main theorems in Paper I is expressed in terms of the Laplace transform of this area. Paper IV provides a new sufficient condition for a collection of independent random variables to be negatively associated when conditioned on their total sum. The condition applies to a collection of independent Borel-distributed random variables, which made it possible to prove a Poisson approximation that where essential for the completion of Paper II.

Place, publisher, year, edition, pages
Uppsala: Universitetsbiblioteket, 2009. viii+20 p.
Uppsala Dissertations in Mathematics, ISSN 1401-2049 ; 63
Probabilistic analysis of algorithms, hashing, linear probing, negative dependence, Brownian motion.
National Category
urn:nbn:se:uu:diva-9545 (URN)978-91-506-2050-4 (ISBN)
Public defence
2009-02-27, Polhemsalen, Ångströmlaboratoriet, Lägerhyddsvägen 1, Uppsala, 13:15
Available from: 2009-02-05 Created: 2009-02-05Bibliographically approved

Open Access in DiVA

No full text

By organisation
Department of Mathematics
Natural Sciences

Search outside of DiVA

GoogleGoogle Scholar

Total: 170 hits
ReferencesLink to record
Permanent link

Direct link