{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:49Z","timestamp":1759335949171},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194873"},{"type":"electronic","value":"9783540392880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19487-8_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:12:14Z","timestamp":1330200734000},"page":"255-262","source":"Crossref","is-referenced-by-count":4,"title":["Tight lower bounds for Shellsort"],"prefix":"10.1007","author":[{"given":"Mark Allen","family":"Weiss","sequence":"first","affiliation":[]},{"given":"Robert","family":"Sedgewick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A. Brauer","year":"1942","unstructured":"A. Brauer, \"On a Problem of Partitions\", American J Mathematics\n64 (1942), 299\u2013312.","journal-title":"American J Mathematics"},{"key":"29_CR2","unstructured":"G. Gonnet, Handbook of Algorithms and Data Structures, Addison-Wesley, 1984."},{"issue":"5","key":"29_CR3","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/366552.366557","volume":"6","author":"T. N. Hibbard","year":"1963","unstructured":"T.N. Hibbard, \"An empirical study of minimal storage sorting\", Communications of the ACM\n6 5(1963), 206\u2013213.","journal-title":"Communications of the ACM"},{"key":"29_CR4","unstructured":"J. Incerpi, \"A Study of the Worst-Case of Shellsort\", Ph.D. Thesis, Brown University, 1985."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"J. Incerpi and R. Sedgewick, \"Improved Upper Bounds on Shellsort\", Proceedings 24th Annual Symposium on Foundations of Computer Science, Tucson 1983, 48\u201355.","DOI":"10.1109\/SFCS.1983.26"},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"390","DOI":"10.4153\/CJM-1960-033-6","volume":"12","author":"S. M. Johnson","year":"1960","unstructured":"S.M. Johnson, \"A linear diophantine problem\", Canadian J. Math.\n12 (1960), 390\u2013398.","journal-title":"Canadian J. Math."},{"key":"29_CR7","volume-title":"The Art of Computer Programming. Volume 3: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D.E. Knuth, The Art of Computer Programming. Volume 3: Sorting and Searching, Addison-Wesley, Reading, Mass. (1973)."},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0022-314X(72)90013-3","volume":"4","author":"A. Nijenhuis","year":"1972","unstructured":"A. Nijenhuis and H.S. Wilf, \"Representations of integers by linear forms in nonnegative integers\", J. Number Theory\n4 (1972), 98\u2013106.","journal-title":"J. Number Theory"},{"issue":"3","key":"29_CR9","first-page":"63","volume":"1","author":"A. A. Papernov","year":"1965","unstructured":"A.A. Papernov and G.V. Stasevich, \"A method of information sorting in computer memories\", Problems of Information Transmission\n1 3(1965), 63\u201375.","journal-title":"Problems of Information Transmission"},{"key":"29_CR10","volume-title":"Shellsort and Sorting Networks","author":"V. Pratt","year":"1979","unstructured":"V. Pratt, Shellsort and Sorting Networks, Garland Publishing, New York (1979). (Originally presented as the author's Ph.D. thesis, Stanford University, 1971.)"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0196-6774(86)90001-5","volume":"2","author":"R. Sedgewick","year":"1986","unstructured":"R. Sedgewick, \"A New Upper Bound for Shellsort\", J. of Algorithms\n2 (1986), 159\u2013173.","journal-title":"J. of Algorithms"},{"key":"29_CR12","first-page":"1","volume":"294","author":"E. S. Selmer","year":"1977","unstructured":"E.S. Selmer, \"On the linear diophantine problem of Frobenius\", J. reine angew. Math.\n294 (1977), 1\u201317.","journal-title":"J. reine angew. Math."},{"key":"29_CR13","unstructured":"E.S. Selmer, \"On Shellsort and the Frobenius problem\", unpublished manuscript."},{"key":"29_CR14","unstructured":"W.J. Curran Sharp, Solution to Problem 7382 (Mathematics), Educational Times, London (1884)."},{"issue":"7","key":"29_CR15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/368370.368387","volume":"2","author":"D. L. Shell","year":"1959","unstructured":"D.L. Shell, \"A high-speed sorting procedure\", Communications of the ACM\n2 7(1959), 30\u201332.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","SWAT 88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19487-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:55:55Z","timestamp":1619556955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19487-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194873","9783540392880"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-19487-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}