Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Improved lower bounds for Shellsort

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Plaxton, C.G. ; Dept. of Comput. Sci., Texas Univ., Austin, TX, USA ; Poonen, B. ; Suel, Torsten

The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort

Published in:

Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on

Date of Conference:

24-27 Oct 1992