Retour à l'index du GREYC

Séminaire Algorithmique

Site du CNRS

Séminaire Algorithmique

Le séminaire a lieu le mardi à 11 h 45 (sauf modification exceptionnelle), au campus Côte de Nacre, bâtiment Sciences 3, salle S3 351, 3ème étage.

Résumé du séminaire du Mardi 22 Juin 2010

Distributional Analysis of the Parking Problem and Robin Hood Linear Probing Hashing with Buckets

par Alfredo Viola (GREYC, Caen et Montevideo, Republica oriental del Uruguay)

In this talk we present the first distributional analysis of both, a parkingproblem and a linear probing hashing scheme with buckets of size b. The exact distribution of the cost of successful searches for a bα-full table is obtained, and moments and asymptotic results are derived. With the use of the Poisson transform distributional results are also obtained for tables of size m and with n elements. We also present results related with the distribution of bucket occupancy. A key element in the analysis is the use of a new family of numbers, that satisfies a recurrence resembling that of the Bernoulli numbers. These numbers may prove helpful in studying recurrences involving truncated generating functions, as well as in other problems related with buckets.

Campus Côte de Nacre, boulevard du Maréchal Juin
BP 5186
14032 Caen Cedex
FAX : +33 (0)2 31 56 73 30