{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:24Z","timestamp":1725663264841},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540505174"},{"type":"electronic","value":"9783540460305"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50517-2_78","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:25:58Z","timestamp":1330201558000},"page":"154-160","source":"Crossref","is-referenced-by-count":3,"title":["An optimal parallel algorithm for sorting presorted files"],"prefix":"10.1007","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]},{"given":"Ola","family":"Petersson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Komlos, E. Szemeredi, \u201cAn O(n log n) sorting network\u201d, Combinatorica 3, 1983, 1\u201319.","journal-title":"Combinatorica"},{"key":"12_CR2","unstructured":"G.Bilardi, A.Nicolau, \u201cAdaptive Bitonic Sorting: An optimal parallel algorithm for shared memory models\u201d, to appear in SIAM Journal on Computing."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"R.Cole, \u201cParallel Merge Sort\u201d, 27th FOCS, 1986, 511\u2013516.","DOI":"10.1109\/SFCS.1986.41"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23-11","author":"C.R. Cook","year":"1980","unstructured":"C.R. Cook, D.J. Kim, \u201cBest sorting algorithms for nearly sorted lists\u201d, Comm. of the ACM 23-11, 1980, 620\u2013624.","journal-title":"Comm. of the ACM"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6423(82)90016-8","volume":"1","author":"E.W. Dijkstra","year":"1982","unstructured":"E.W. Dijkstra, \u201cSmoothsort, an alternative to sorting in situ\u201d, Science of Computer Programming 1, 1982, 223\u2013233.","journal-title":"Science of Computer Programming"},{"key":"12_CR6","unstructured":"V.Estivill-Castro, D.Wood, \u201cA new measure of presortedness\u201d, Research Report CS-87-58, 1987, Waterloo."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"H.Mannila, \u201cMeasures of presortedness and optimal sorting algorithms\u201d, ICALP 1984, 324\u2013336.","DOI":"10.1007\/3-540-13345-3_29"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"K.Mehlhorn, \u201cSorting presorted files\u201d, 4th GI Conference on Theoretical Computer Science, Springer Verlag, 1979, 199\u2013212.","DOI":"10.1007\/3-540-09118-1_22"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"K.Mehlhorn, \u201cData Structures and Algorithms 1: Sorting and Searching\u201d, Springer Verlag, 1984, 217\u2013228.","DOI":"10.1007\/978-3-642-69672-5_2"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50517-2_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:20Z","timestamp":1605647900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50517-2_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540505174","9783540460305"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-50517-2_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}