janson and knuth"shellsort with three increments,random structures and algorithms ( ) - jiangm liand vitanyi" lower bound on the average-case complexity of shellsort,journal of the acm ( ) - knuththe art of computer programming volume sorting and searching ed addison-wesleyreadingmass manacher"the ford-johnson sorting algorithm is not optimal,journal of the acm ( ) - musser"introspective sorting and selection algorithms,software--practice and experience ( ) - papernov and stasevich" method of information sorting in computer memories,problems of information transmission ( ) - plaxtonb poonenand suel"improved lower bounds for shellsort,proceedings of the thirty-third annual symposium on the foundations of computer science ( ) - pohl" sorting problem and its complexity,communications of the acm ( ) - prattshellsort and sorting networksgarland publishingnew york (originally presented as the author' ph thesisstanford university schaffer and sedgewick"the analysis of heapsort,journal of algorithms ( ) - sedgewick"quicksort with equal keys,siam journal on computing ( ) - sedgewick"the analysis of quicksort programs,acta informatica ( ) - sedgewick"implementing quicksort programs,communications of the acm ( ) - sedgewickquicksortgarland publishingnew york (originally presented as the author' ph thesisstanford university sedgewick" new upper bound for shellsort,journal of algorithms ( ) - shell" high-speed sorting procedure,communications of the acm ( ) - weiss"empirical results on the running time of shellsort,computer journal ( ) - weiss and sedgewick"more on shellsort increment sequences,information processing letters ( ) - weiss and sedgewick"tight lower bounds for shellsort,journal of algorithms ( ) - williams"algorithm heapsort,communications of the acm ( ) - yao"an analysis of (hk shellsort,journal of algorithms ( ) -