Lower Bounds for Shellsort

DOI10.1006/JAGM.1996.0825MaRDI QIDQ4339002zbMATH OpenOpenAlexFDO

Authors C. Greg Plaxton, Torsten Suel

Publication date 4 June 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0825

zbMATH Keywords

Shellsort algorithm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 1256658
• A Lower Bound on the Size of Shellsort Sorting Networks
• The Worst Case in Shellsort and Related Algorithms

Cited in

(11)

• Improved upper bounds on Shellsort
• Analyzing variants of Shellsort
• Shellsort with a constant number of increments
• On shellsort and the Frobenius problem
• The Worst Case in Shellsort and Related Algorithms
• Tight lower bounds for Shellsort
• A Lower Bound on the Size of Shellsort Sorting Networks
• scientific article; zbMATH DE number 4126701 (Why is no real title available?)
• scientific article; zbMATH DE number 1256658 (Why is no real title available?)
• On the average-case complexity of Shellsort
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons

This page was built for publication: Lower Bounds for Shellsort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339002)