The analysis of linear probing sort by the use of a new mathematical transform

DOI10.1016/0196-6774(84)90001-4zbMath0606.68058OpenAlexW2039976422MaRDI QIDQ3745295

Gaston H. Gonnet, J. Ian Munro

Publication date: 1984

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(84)90001-4

zbMATH Keywords

Poisson approximationparking problemdistribution sort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (7)

The binomial transform and the analysis of skip lists ⋮ Parking functions for mappings ⋮ On the distribution for the duration of a randomized leader election algorithm ⋮ Analytical depoissonization and its applications ⋮ In-place linear probing sort ⋮ The binomial transform and its application to the analysis of skip lists ⋮ The Diagonal Poisson Transform and its application to the analysis of a hashing scheme

This page was built for publication: The analysis of linear probing sort by the use of a new mathematical transform