Performance of distributive partitioned sort in a demand paging environment
Information Processing Letters
Expected time bounds for selection
Communications of the ACM
Algorithm 489: the algorithm SELECT—for finding the ith smallest of n elements [M1]
Communications of the ACM
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Hi-index | 0.00 |