{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:09Z","timestamp":1759335789296},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/0196-6774(86)90001-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"159-173","source":"Crossref","is-referenced-by-count":24,"title":["A new upper bound for Shellsort"],"prefix":"10.1016","volume":"7","author":[{"given":"Robert","family":"Sedgewick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(86)90001-5_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\/0196-6774(86)90001-5_BIB2","series-title":"Darstellung von Gruppen","author":"Boerner","year":"1955"},{"key":"10.1016\/0196-6774(86)90001-5_BIB3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2307\/2371684","article-title":"On a problem of partitions","volume":"64","author":"Brauer","year":"1942","journal-title":"Amer. J. Math."},{"key":"10.1016\/0196-6774(86)90001-5_BIB4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01403673","article-title":"An algorithm for a linear diophantine equation and a problem of Frobenius","volume":"34","author":"Greenberg","year":"1980","journal-title":"Numer. Math."},{"key":"10.1016\/0196-6774(86)90001-5_BIB5","first-page":"1","article-title":"Zu einem Problem von Frobenius","volume":"5","author":"Hofmeister","year":"1966","journal-title":"Norske Vid. Selsk. Skr."},{"key":"10.1016\/0196-6774(86)90001-5_BIB6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/0022-0000(85)90042-X","article-title":"Improved upper bounds on Shellsort","volume":"31","author":"Incerpi","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(86)90001-5_BIB7","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\/0196-6774(86)90001-5_BIB8","series-title":"The Art of Computer Programming. 3. Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(86)90001-5_BIB9","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"},{"key":"10.1016\/0196-6774(86)90001-5_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1112\/blms\/5.1.75","article-title":"On a linear diophantine problem","volume":"5","author":"Lewin","year":"1973","journal-title":"Bull. London Math. Soc."},{"issue":"3","key":"10.1016\/0196-6774(86)90001-5_BIB11","first-page":"63","article-title":"A method of information sorting in computer memories","volume":"1","author":"Papernov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0196-6774(86)90001-5_BIB12_1","series-title":"Shellsort and Sorting Networks","author":"Pratt","year":"1979"},{"key":"10.1016\/0196-6774(86)90001-5_BIB12_2","author":"Pratt","year":"1971"},{"key":"10.1016\/0196-6774(86)90001-5_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1515\/crll.1977.293-294.1","article-title":"On the linear diophantine problem of Frobenius","volume":"294","author":"Selmer","year":"1977","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0196-6774(86)90001-5_BIB14","article-title":"Solution to Problem 7382 (Mathematics)","author":"Curran Sharp","year":"1884","journal-title":"Educational Times"},{"issue":"7","key":"10.1016\/0196-6774(86)90001-5_BIB15","first-page":"30","article-title":"A high-speed sorting procedure","volume":"2","author":"Shell","year":"1959","journal-title":"Comm. Assoc. Comput. Mach."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:25:40Z","timestamp":1548743140000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677486900015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0196677486900015"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(86)90001-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}