{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T17:00:36Z","timestamp":1771779636652,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":[[1987,12]]},"DOI":"10.1016\/0196-6774(87)90050-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"557-571","source":"Crossref","is-referenced-by-count":26,"title":["Simplified stable merging tasks"],"prefix":"10.1016","volume":"8","author":[{"given":"Jeffrey","family":"Salowe","sequence":"first","affiliation":[]},{"given":"William","family":"Steiger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(87)90050-2_BIB1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(74)90004-0","article-title":"A stable minimum storage algorithm","volume":"2","author":"Dewar","year":"1974","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(87)90050-2_BIB2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(81)90065-X","article-title":"On a stable minimum storage merging algorithm","volume":"12","author":"Dudzinski","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(87)90050-2_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/322063.322064","article-title":"Stable sorting in asymptotically optimal time and extra space","volume":"25","author":"Horvath","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(87)90050-2_BIB4","series-title":"Practical In-Place Merging","author":"Huang","year":"1986"},{"key":"10.1016\/0196-6774(87)90050-2_BIB5","series-title":"Proceedings, I.F.I.P. Congress","first-page":"19","article-title":"Mathematical analysis of algorithms","author":"Knuth","year":"1971"},{"key":"10.1016\/0196-6774(87)90050-2_BIB6","volume":"Vol. III","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(87)90050-2_BIB7","first-page":"744","article-title":"Optimal ordering algorithm without operational field","volume":"10","author":"Kronrod","year":"1969","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0196-6774(87)90050-2_BIB8","first-page":"16","article-title":"An algorithm for in-situ permutation","volume":"2","author":"Macleod","year":"1970","journal-title":"Austral. Comput. J."},{"key":"10.1016\/0196-6774(87)90050-2_BIB9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(84)90112-1","article-title":"A simple linear-time algorithm for in situ merging","volume":"18","author":"Mannila","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(87)90050-2_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-3975(75)90019-5","article-title":"A fast stable sorting algorithm with absolutely minimal storage","volume":"1","author":"Preparata","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(87)90050-2_BIB11","series-title":"A Note on Unmerging","author":"Reed","year":"1985"},{"key":"10.1016\/0196-6774(87)90050-2_BIB12","series-title":"A Fast Stable Minimal Storage Sorting Algorithm","author":"Rivest","year":"1973"},{"issue":"No. 1","key":"10.1016\/0196-6774(87)90050-2_BIB13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/382250.382251","article-title":"On the unmerging problem","volume":"17","author":"Santoro","year":"1985","journal-title":"SIGACT News"},{"key":"10.1016\/0196-6774(87)90050-2_BIB14","article-title":"Letter to the Editor","volume":"17","author":"Schaffer","year":"1985","journal-title":"SIGACT News"},{"key":"10.1016\/0196-6774(87)90050-2_BIB15","series-title":"Stable Unmerging in Linear Time and Constant Space","author":"Salowe","year":"1985"},{"key":"10.1016\/0196-6774(87)90050-2_BIB16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0206025","article-title":"Stable sorting and merging with optimal space and time bounds","volume":"6","author":"Trabb Pardo","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(87)90050-2_BIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01933160","article-title":"Some simple in-place merging algorithms","volume":"21","author":"Wong","year":"1981","journal-title":"Bit"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900502?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:24:33Z","timestamp":1548743073000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677487900502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0196677487900502"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(87)90050-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}