Pré-Publication, Document De Travail Année : 2026

Bounded linear probing hashing

Résumé

We introduce a process that inserts elements into a hash table with a bounded number of probes, motivated by an application in cryptography. The cost of this algorithm is the number of insertion trials, whether successful or failed, until the table gets completely filled. This gives an interpolation between linear probing hashing and the coupon collector problem. We show that the process is related to a non-linear differential equation, which allows us to obtain the generating function of full tables. The proofs involve a full algebra of operators, which are themselves of independent interest. Then, we obtain the asymptotic behaviour of the expected number of insertion trials to get a full table.

Fichier principal
Vignette du fichier
asymptotic.pdf (1.55 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
licence

Dates et versions

hal-05612913 , version 1 (05-05-2026)

Licence

Identifiants

Citer

Ahmed Alharbi, Cyril Banderier, Charles Bouillaguet. Bounded linear probing hashing. 2026. ⟨hal-05612913⟩
47 Consultations
16 Téléchargements

Altmetric

Partager

  • More