Improved upper bounds on shellsort

An 0(n log n) sorting network

Miklós Ajtai, János Komlós, Endre Szemerédi · 1983 · 671 citations

Computing, Computer Science, Mathematics +11

A high-speed sorting procedure

Donald L. Shell · Communications of the ACM · 1959 · 197 citations · Full text

Computing, Computer Science, Electrical Engineering +6

A Linear Diophantine Problem

Silas Johnson · Canadian Journal of Mathematics · 1960 · 149 citations · Full text

Natural Sciences, Mathematics, Discrete Mathematics +6

Tight bounds on the complexity of parallel sorting

Tom Leighton · 1984 · 114 citations · Full text

Computing, Computer Engineering, Computer Science +17

A new upper bound for Shellsort

Robert Sedgewick · Journal of Algorithms · 1986 · 37 citations

Computing, Computer Science, Mathematics +7