{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:16:56Z","timestamp":1759335416644},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10151,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0022-0000(85)90042-x","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"210-224","source":"Crossref","is-referenced-by-count":26,"title":["Improved upper bounds on shellsort"],"prefix":"10.1016","volume":"31","author":[{"given":"Janet","family":"Incerpi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Sedgewick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(85)90042-X_BIB1","series-title":"Proceedings 15th Annual ACM Symposium of Theory of Computing","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0022-0000(85)90042-X_BIB2","article-title":"Solution to Problem 7382 (Mathematics)","volume":"1","author":"Curran-sharp","year":"1884","journal-title":"Ed. Times (London)"},{"key":"10.1016\/0022-0000(85)90042-X_BIB3","unstructured":"B. Chazelle, private communication, 1983."},{"issue":"No. 1","key":"10.1016\/0022-0000(85)90042-X_BIB4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(80)90022-8","article-title":"An efficient variation of bubble sort","volume":"11","author":"Dobosiewicz","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(85)90042-X_BIB5","doi-asserted-by":"crossref","first-page":"390","DOI":"10.4153\/CJM-1960-033-6","article-title":"A linear diophantine problem","volume":"12","author":"Johnson","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/0022-0000(85)90042-X_BIB6","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(85)90042-X_BIB7","series-title":"Proceedings 16th Annual ACM Symposium of Theory of Computing","article-title":"Tight bounds on the complexity of parallel sorting","author":"Leighton","year":"1984"},{"issue":"No. 3","key":"10.1016\/0022-0000(85)90042-X_BIB8","first-page":"63","article-title":"A method of information sorting in computer memories","volume":"1","author":"Papernov","year":"1965","journal-title":"Probl. Inform. Transmiss."},{"key":"10.1016\/0022-0000(85)90042-X_BIB9","article-title":"Shellsort and Sorting Networks","author":"Pratt","year":"1979"},{"key":"10.1016\/0022-0000(85)90042-X_BIB10","series-title":"Algorithms","author":"Sedgewick","year":"1983"},{"key":"10.1016\/0022-0000(85)90042-X_BIB11","doi-asserted-by":"crossref","unstructured":"R. Sedgewick, A new upper bound for Shellsort, J. Algorithms, in press.","DOI":"10.1016\/0196-6774(86)90001-5"},{"key":"10.1016\/0022-0000(85)90042-X_BIB12","first-page":"1","article-title":"On the linear diophantine problem of Frobenius","volume":"294","author":"Selmer","year":"1977","journal-title":"J. Reine Angew. Math."},{"issue":"No. 7","key":"10.1016\/0022-0000(85)90042-X_BIB13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/368370.368387","article-title":"A high-speed sorting procedure","volume":"2","author":"Shell","year":"1959","journal-title":"Comm. ACM"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008590042X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008590042X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:54:03Z","timestamp":1550332443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008590042X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["002200008590042X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90042-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}