{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T11:37:45Z","timestamp":1672745865614},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"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":[[1983,6]]},"DOI":"10.1007\/bf02218438","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T04:33:43Z","timestamp":1128573223000},"page":"170-180","source":"Crossref","is-referenced-by-count":6,"title":["Linear sorting withO(logn) processors"],"prefix":"10.1007","volume":"23","author":[{"given":"J. A.","family":"Orenstein","sequence":"first","affiliation":[]},{"given":"T. H.","family":"Merrett","sequence":"additional","affiliation":[]},{"given":"L.","family":"Devroye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02218438_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"key":"BF02218438_CR2","first-page":"307","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K. E. Batcher,Sorting networks and their applications, Proceedings of the AFIPS Spring Joint Conference 32, pp. 307\u2013314, 1968.","journal-title":"Proceedings of the AFIPS Spring Joint Conference"},{"key":"BF02218438_CR3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest and R. E. Tarjan,Time bounds for selection, Journal of Computer and System Sciences 7, pp. 448\u2013461, 1973.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02218438_CR4","volume-title":"Exponential bounds for the running time of a selection algorithm","author":"L. Devroye","year":"1982","unstructured":"L. Devroye,Exponential bounds for the running time of a selection algorithm, Manuscript, McGill University, Montreal, 1982."},{"key":"BF02218438_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02241778","volume":"26","author":"L. Devroye","year":"1981","unstructured":"L. Devroye and T. Klincsek,Average time behaviour of distributive sorting algorithms, Computing 26, pp. 107, 1981.","journal-title":"Computing"},{"key":"BF02218438_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(78)90028-5","volume":"7","author":"W. Dobosiewicz","year":"1978","unstructured":"W. Dobosiewicz,Sorting by distributive partitioning, Information Processing Letters 7, pp. 1\u20136, 1978.","journal-title":"Information Processing Letters"},{"key":"BF02218438_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/360680.360691","volume":"18","author":"R. W. Floyd","year":"1975","unstructured":"R. W. Floyd and R. L. Rivest,Expected time bounds for selection, Communications of the ACM 18, pp. 165\u2013173, 1975.","journal-title":"Communications of the ACM"},{"key":"BF02218438_CR8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/359576.359582","volume":"21","author":"D. S. Hirschberg","year":"1978","unstructured":"D. S. Hirschberg,Fast parallel sorting algorithms, Communications of the ACM 21, pp. 657\u2013661, 1978.","journal-title":"Communications of the ACM"},{"key":"BF02218438_CR9","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C. A. R. Hoare","year":"1962","unstructured":"C. A. R. Hoare,Quicksort, Computer Journal 5, pp. 10\u201315, 1962.","journal-title":"Computer Journal"},{"key":"BF02218438_CR10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C. A. R. Hoare","year":"1961","unstructured":"C. A. R. Hoare,FIND (Algorithm 65), Communications of the ACM 4, pp. 321\u2013322, 1961.","journal-title":"Communications of the ACM"},{"key":"BF02218438_CR11","volume-title":"The Art of Computer Programming, Vol. 3. Sorting and Scarching","author":"D. E. Knuth","year":"1975","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 3. Sorting and Scarching, Addison-Wesley, Reading, Mass., 1975."},{"key":"BF02218438_CR12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","volume":"C-27","author":"F. P. Preparata","year":"1978","unstructured":"F. P. Preparata,New parallel-sorting schemes, IEEE Transactions on Computers, C-27, pp. 669\u2013673, 1978.","journal-title":"IEEE Transactions on Computers"},{"key":"BF02218438_CR13","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Schonhage","year":"1976","unstructured":"A. Schonhage, M. Paterson and N. Pippenger,Finding the median, Journal of Computer and System Sciences 13, pp. 184\u2013199, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02218438_CR14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF00289467","volume":"7","author":"R. Sedgewick","year":"1977","unstructured":"R. Sedgewick,The analysis of quicksort programs, Acta Informatica 7, pp. 327\u2013355, 1977.","journal-title":"Acta Informatica"},{"key":"BF02218438_CR15","first-page":"1","volume":"16","author":"P. G. Sorenson","year":"1978","unstructured":"P. G. Sorenson, J. P. Tremblay and R. F. Deutscher,Key-to-address transformation techniques, INFOR 16, pp. 1\u201334, 1978.","journal-title":"INFOR"},{"key":"BF02218438_CR16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1147\/rd.225.0509","volume":"22","author":"S. Todd","year":"1978","unstructured":"S. Todd,Algorithm and hardware for a mergesort using multiple processors, IBM Journal of Research and Development 22, pp. 509\u2013517, 1978.","journal-title":"IBM Journal of Research and Development"},{"key":"BF02218438_CR17","doi-asserted-by":"crossref","DOI":"10.1201\/b15702","volume-title":"Measure and Integral","author":"R. L. Wheeden","year":"1977","unstructured":"R. L. Wheeden and A. Zygmund,Measure and Integral, Marcel Dekker, New York, 1977."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02218438.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02218438\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02218438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T18:04:11Z","timestamp":1557857051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02218438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["BF02218438"],"URL":"https:\/\/doi.org\/10.1007\/bf02218438","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}