{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:42Z","timestamp":1725663162118},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540186250"},{"type":"electronic","value":"9783540480334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:40:19Z","timestamp":1330198819000},"page":"195-206","source":"Crossref","is-referenced-by-count":2,"title":["On optimal parallelization of sorting networks"],"prefix":"10.1007","author":[{"given":"Ethan","family":"Gannett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suraj C.","family":"Kothari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"15_CR1","unstructured":"R.S. Boyer and J.S. Moore, A Computational Logic, Academic Press, 1979."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0304-3975(86)90033-2","volume":"46","author":"C.-H. Huang","year":"1986","unstructured":"C.-H. Huang and C. Lengauer, The automated proof of a trace transformation for a bitonic sort, Theoretical Computer Science, 46, (1986), pp. 261\u2013284.","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","volume-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, MA,(1973)."},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0167-6423(82)90003-X","volume":"2","author":"C. Lengauer","year":"1982","unstructured":"C. Lengauer, A methodology for programming with concurrency: The formalism, Sci. of Comput. Programm., 2, (1), (1982), pp. 19\u201352.","journal-title":"Sci. of Comput. Programm."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(82)90002-8","volume":"2","author":"C. Lengauer","year":"1982","unstructured":"C. Lengauer and E.C.R. Hehner, A methodology for programming with concurrency: An informal presentation, Sci. of Comput. Programm., 2, (1), (1982), pp. 1\u201318.","journal-title":"Sci. of Comput. Programm."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"C.Lengauer and C.-H. Huang, A mechanically certified theorem about optimal concurrency of sorting networks, Proc. 13th Ann. ACM Symp. on Principles of Programming Languages, (1986), pp. 307\u2013317.","DOI":"10.1145\/512644.512673"}],"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-18625-5_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:15:48Z","timestamp":1619558148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}