We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...