Analytic variations on bucket selection and sorting
From MaRDI portal
Publication:1567201
DOI10.1007/S002360050173zbMATH Open0958.68056OpenAlexW2015026288MaRDI QIDQ1567201FDOQ1567201
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
Recommendations
Cited In (14)
- Some results on tries with adaptive branching.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distribution of distances in random binary search trees.
- Analysis of swaps in radix selection
- Title not available (Why is that?)
- Dependence between path-length and size in random digital trees
- Multikey quickselect
- An analytic approach to the asymptotic variance of trie statistics and related structures
- 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
- Process convergence for the complexity of radix selection on Markov sources
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)