Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation

Analytic Variations on Bucket Selection and Sorting

Hosam Mahmoud Philippe Flajolet 1 Philippe Jacquet 2 Mireille Regnier 1
1 ALGO - Algorithms
Inria Paris-Rocquencourt
2 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We provide complete average-case as well as probabilistic analysis of the cost of bucket selection and sorting algorithms. Two variations of bucketing (and flavors there in) are considered: distributive bucketing (large number of buckets) and radix bucketing (recursive with a small number of buckets, suitable for digital computation). For Distributive Selection a compound Poisson limit is established. For all other flavors of bucket selection and sorting, central limit theorems underlying the cost are derived by asymptotic techniques involving perturbation of Rice's integral and contour integration (saddle point methods). In the case of radix bucketing, periodic luctuations appear in the moments of both the selection and sorting algorithms.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 12:26:50 PM
Last modification on : Thursday, February 3, 2022 - 11:17:59 AM
Long-term archiving on: : Thursday, March 24, 2011 - 12:36:18 PM


  • HAL Id : inria-00073290, version 1



Hosam Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Regnier. Analytic Variations on Bucket Selection and Sorting. [Research Report] RR-3399, INRIA. 1998. ⟨inria-00073290⟩



Record views


Files downloads