Analytic variations on bucket selection and sorting

DOI10.1007/S002360050173zbMath0958.68056OpenAlexW2015026288MaRDI QIDQ1567201

Philippe Flajolet, Mireille Régnier, Philippe Jacquet, Hosam M. Mahmoud

Publication date: 2000

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00073290/file/RR-3399.pdf

zbMATH Keywords

sorting algorithmsbucket selection

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (10)

Distribution of distances in random binary search trees. ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ Process convergence for the complexity of radix selection on Markov sources ⋮ Multikey quickselect ⋮ Analysis of swaps in radix selection ⋮ Distribution of the size of random hash trees, pebbled hash trees and \(N\)-trees ⋮ Dependence between path-length and size in random digital trees ⋮ Upper tail analysis of bucket sort and random tries ⋮ Upper tail analysis of bucket sort and random tries ⋮ Some results on tries with adaptive branching.

This page was built for publication: Analytic variations on bucket selection and sorting