{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:20:37Z","timestamp":1648740037378},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1007\/bf02017344","type":"journal-article","created":{"date-parts":[[2005,8,5]],"date-time":"2005-08-05T17:52:59Z","timestamp":1123264379000},"page":"220-234","source":"Crossref","is-referenced-by-count":12,"title":["Stable in situ sorting and minimum data movement"],"prefix":"10.1007","volume":"30","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey S.","family":"Salowe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02017344_CR1","unstructured":"S. Baase,Computer Algorithms: Introduction to Design and Analysis, Addison-Wesley (1988)."},{"key":"BF02017344_CR2","doi-asserted-by":"crossref","unstructured":"B. \u010eurian,Quicksort without a stack, Math. Foundations of Computer Science,Lecture Notes in Computer Science 223,Springer Verlag (1986) 283\u2013289.","DOI":"10.1007\/BFb0016252"},{"key":"BF02017344_CR3","unstructured":"D. Gries,Constant-space quicksort, Unpublished manuscript, March 1989."},{"issue":"7","key":"BF02017344_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"T. Hoare","year":"1961","unstructured":"T. Hoare,Quicksort, CACM 4 (7) (1961) 321.","journal-title":"CACM"},{"key":"BF02017344_CR5","unstructured":"D. E. Knuth,The Art of Computer Programming. Volume III: Sorting and Searching, Addison-Wesley (1973)."},{"key":"BF02017344_CR6","first-page":"19","volume-title":"Mathematical Analysis of Algorithms","author":"D. E. Knuth","year":"1972","unstructured":"D. E. Knuth,Mathematical Analysis of Algorithms, Proceedings, I.F.I.P. Congress, ed. C.V. Frieman, North-Holland, Amsterdam (1972) 19\u201327."},{"key":"BF02017344_CR7","first-page":"744","volume":"10","author":"M. A. Kronrod","year":"1969","unstructured":"M. A. Kronrod,Optimal ordering algorithm without operational field, Soviet Math. Dokl.10 (1969) 744\u2013746.","journal-title":"Soviet Math. Dokl."},{"key":"BF02017344_CR8","first-page":"16","volume":"2","author":"I. D. G. Macleod","year":"1970","unstructured":"I. D. G. Macleod,An algorithm for in-situ permutation, Australian Computing Journal2 (1970) 16\u201319.","journal-title":"Australian Computing Journal"},{"key":"BF02017344_CR9","doi-asserted-by":"crossref","unstructured":"J. I. Munro and V. Raman,Sorting with minimum data movement, Proceedings of Workshop on Algorithms and Data Structures, Ottawa,Lecture Notes in Computer Science 382,Springer Verlag (August 1989) 552\u2013562.","DOI":"10.1007\/3-540-51542-9_46"},{"key":"BF02017344_CR10","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0206025","volume":"6","author":"L. Trabb Pardo","year":"1977","unstructured":"L. Trabb Pardo,Stable sorting and merging with optimal space and time bounds, SIAM J. on Computing6 (1977) 351\u2013372.","journal-title":"SIAM J. on Computing"},{"key":"BF02017344_CR11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0020-0190(87)90202-X","volume":"25","author":"J. S. Salowe","year":"1987","unstructured":"J. S. Salowe and W. L. Steiger,Stable unmerging in linear time and constant space, IPL25 (1987) 285\u2013294.","journal-title":"IPL"},{"key":"BF02017344_CR12","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/0196-6774(87)90050-2","volume":"8","author":"J. S. Salowe","year":"1987","unstructured":"J. S. Salowe and W. L. Steiger,Simplified stable merging tasks, J. Algorithms 8 (1987) 557\u2013571.","journal-title":"J. Algorithms"},{"key":"BF02017344_CR13","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF01937353","volume":"27","author":"L. M. Wegner","year":"1987","unstructured":"L. M. Wegner,A generalized one way stackless quicksort, BIT27 (1987) 44\u201348.","journal-title":"BIT"},{"key":"BF02017344_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1093\/comjnl\/2.1.47","volume":"2","author":"P. F. Windley","year":"1959","unstructured":"P. F. Windley,Transposing matrices in a digital computer, The Computer Journal2 (1959) 47\u201348.","journal-title":"The Computer Journal"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02017344.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02017344\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02017344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T18:38:00Z","timestamp":1586371080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02017344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF02017344"],"URL":"https:\/\/doi.org\/10.1007\/bf02017344","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}