{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:31:42Z","timestamp":1648848702045},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":[[1991,6]]},"DOI":"10.1007\/bf01931280","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T20:17:25Z","timestamp":1122754645000},"page":"194-201","source":"Crossref","is-referenced-by-count":0,"title":["The recursive structure of some ordering problems"],"prefix":"10.1007","volume":"31","author":[{"given":"M. D.","family":"Atkinson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01931280_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974."},{"key":"BF01931280_CR2","first-page":"29","volume":"4","author":"M. D. Atkinson","year":"1988","unstructured":"M. D. Atkinson,Sorting with powerful primitive operations, J. Comb. Math. and Comb. Comput. 4 (1988), 29\u201336.","journal-title":"J. Comb. Math. and Comb. Comput."},{"issue":"5","key":"BF01931280_CR3","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/12.53587","volume":"39","author":"R. Beigel","year":"1990","unstructured":"R. Beigel, J. Gill,Sorting n objects with a k-sorter, IEEE Trans. on Computers, 39, No. 5 (May 1990), 714\u2013716.","journal-title":"IEEE Trans. on Computers"},{"key":"BF01931280_CR4","doi-asserted-by":"crossref","unstructured":"S. W. Bent, J. W. John,Finding the median requires 2n comparisons, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing (1985), 213\u2013216.","DOI":"10.1145\/22145.22169"},{"key":"BF01931280_CR5","volume-title":"The Art of Computer Programming, vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,Sorting and Searching, The Art of Computer Programming, vol. 3, Addison-Wesley, Reading, Massachusetts, 1973."},{"key":"BF01931280_CR6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"M. S. Paterson","year":"1976","unstructured":"M. S. Paterson, A. Sch\u00f6nhage, N. Pippenger,Finding the median, J. Computer and System Sciences 13 (1976), 184\u2013199.","journal-title":"J. Computer and System Sciences"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01931280.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01931280\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01931280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:55:17Z","timestamp":1557449717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01931280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01931280"],"URL":"https:\/\/doi.org\/10.1007\/bf01931280","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}