Multiple Quickselect—Hoare's Find algorithm for several elements
Information Processing Letters
On the distribution of binary search trees under the random permutation model
Random Structures & Algorithms
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
proceedings of the eighth international conference on Random structures and algorithms
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Sorting algorithms for broadcast communications: mathematical analysis
Theoretical Computer Science
Comparisons in Hoare's Find Algorithm
Combinatorics, Probability and Computing
On binary search tree recursions with monomials as toll functions
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
On quickselect, partial sorting and multiple quickselect
Information Processing Letters
| Hi-index | 0.00 |
We study recursions that are traditional in the context of binary search trees and quicksort with the (non-standard) toll function Hn.