Algorithms 402: Increasing the efficiency of quicksort
Communications of the ACM
Communications of the ACM
A Mathematical Theory of Communication
A Mathematical Theory of Communication
Strong concentration for Quicksort
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Some performance tests of “quicksort” and descendants
Communications of the ACM
On the probability distribution of the values of binary trees
Communications of the ACM
Algorithms 402: Increasing the efficiency of quicksort
Communications of the ACM
On the Performance of WEAK-HEAPSORT
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Pushing the Limits in Sequential Sorting
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Analysis of multiple quickselect variants
Theoretical Computer Science
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Acceleration of sweep-line technique by employing smart quicksort
Information Sciences—Informatics and Computer Science: An International Journal
Asymptotic distributions for Random Median Quicksort
Journal of Discrete Algorithms
An Optimal Drum Scheduling Algorithm
IEEE Transactions on Computers
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A guided bibliography to sorting
IBM Systems Journal
Fringe analysis for Extquick: Anin situ distributive external sorting algorithm
Information and Computation
Hi-index | 48.27 |