Lower Bounds for Shellsort

DOI10.1006/JAGM.1996.0825zbMATH Open0874.68101OpenAlexW1983881259MaRDI QIDQ4339002FDOQ4339002

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

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

zbMATH Keywords

Shellsort algorithm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited In (8)

• Title not available (Why is that?)
• A Lower Bound on the Size of Shellsort Sorting Networks
• The Worst Case in Shellsort and Related Algorithms
• Tight lower bounds for Shellsort
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• Improved upper bounds on Shellsort
• Analyzing variants of Shellsort
• On shellsort and the Frobenius problem

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)