Radix Exchange—An Internal Sorting Method for Digital Computers
Journal of the ACM (JACM)
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A high-speed sorting procedure
Communications of the ACM
A high-speed sorting procedure
Communications of the ACM
A lower bound on the size of shellsort networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM (JACM)
Quicksort algorithms with an early exit for sorted subfiles
CSC '87 Proceedings of the 15th annual conference on Computer Science
Algorithm 346: F-Test Probabilities
Communications of the ACM
ACM Computing Surveys (CSUR)
Remark on algorithm 201 [M1]: shellsort
Communications of the ACM
On the probability distribution of the values of binary trees
Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
Communications of the ACM
Algorithm 268: ALGOL 60 reference language editor [R2]
Communications of the ACM
Algorithm 269: determinant evaluation [F3]
Communications of the ACM
Communications of the ACM
On the Performance of WEAK-HEAPSORT
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Best Increments for the Average Case of Shellsort
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
A guided bibliography to sorting
IBM Systems Journal
Increasing the efficiency of quicksort using a neural network based algorithm selection model
Information Sciences: an International Journal
| Hi-index | 48.33 |