Analytic variations on bucket selection and sorting

DOI10.1007/S002360050173MaRDI QIDQ1567201zbMATH OpenOpenAlexFDO

Authors Philippe Flajolet, Philippe Jacquet, Mireille Régnier, 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

bucket selectionsorting algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1540682
• Analysis of radix selection on Markov sources
• Upper tail analysis of bucket sort and random tries
• Upper tail analysis of bucket sort and random tries

Cited in

(15)

• An analysis and implementation of an efficient in-place bucket sort
• Process convergence for the complexity of radix selection on Markov sources
• Some results on tries with adaptive branching.
• Distribution of distances in random binary search trees.
• An analytic approach to the asymptotic variance of trie statistics and related structures
• Analysis of swaps in radix selection
• scientific article; zbMATH DE number 4051016 (Why is no real title available?)
• scientific article; zbMATH DE number 62475 (Why is no real title available?)
• scientific article; zbMATH DE number 1540682 (Why is no real title available?)
• Dependence between path-length and size in random digital trees
• Multikey quickselect
• scientific article; zbMATH DE number 2247679 (Why is no real title available?)
• Upper tail analysis of bucket sort and random tries
• Upper tail analysis of bucket sort and random tries
• Distribution of the size of random hash trees, pebbled hash trees and N-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567201)