A lower bound on the average-case complexity of Shellsort

2000

Journal of the ACM , Volume 47 - Issue 5 p. 905- 911

Additional Metadata
MSC	Searching and sorting (msc 68P10), Analysis of algorithms and problem complexity (msc 68Q25), Algorithmic information theory (Kolmogorov complexity, etc.) (msc 68Q30)
Journal	Journal of the ACM
Organisation	Quantum Computing and Advanced System Research
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Jiang, T., Li, M., & Vitányi, P. (2000). A lower bound on the average-case complexity of Shellsort. Journal of the ACM, 47(5), 905–911.

Additional Files
Publisher Version

Publication