{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:58:28Z","timestamp":1725843508229},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319274355"},{"type":"electronic","value":"9783319274362"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27436-2_8","type":"book-chapter","created":{"date-parts":[[2015,12,16]],"date-time":"2015-12-16T02:06:46Z","timestamp":1450231606000},"page":"127-142","source":"Crossref","is-referenced-by-count":3,"title":["Applying Sorting Networks to Synthesize Optimized Sorting Libraries"],"prefix":"10.1007","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Cruz-Filipe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Nebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,17]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-04921-2_19","volume-title":"Language and Automata Theory and Applications","author":"D Bundala","year":"2014","unstructured":"Bundala, D., Z\u00e1vodn\u00fd, J.: Optimal sorting networks. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 236\u2013247. Springer, Heidelberg (2014)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Codish, M., Cruz-Filipe, L., Frank, M., Schneider-Kamp, P.: Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten). In: ICTAI 2014, pp. 186\u2013193. IEEE, December 2014","DOI":"10.1109\/ICTAI.2014.36"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Codish, M., Cruz-Filipe, L., Schneider-Kamp, P.: The quest for optimal sorting networks: efficient generation of two-layer prefixes. In: Winkler, F., Negru, V., Ida, T., Jebelan, T., Petcu, D., Watt, S.M., Zaharie, D., (eds.) SYNASC 2014, pp. 359\u2013366. IEEE (2015)","DOI":"10.1109\/SYNASC.2014.55"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1007\/978-3-319-15579-1_52","volume-title":"Language and Automata Theory and Applications","author":"M Codish","year":"2015","unstructured":"Codish, M., Cruz-Filipe, L., Schneider-Kamp, P.: Sorting networks: the end game. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 664\u2013675. Springer, Heidelberg (2015)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-20028-6_17","volume-title":"Evolving Computability","author":"T Ehlers","year":"2015","unstructured":"Ehlers, T., M\u00fcller, M.: New bounds on optimal sorting networks. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 167\u2013176. Springer, Heidelberg (2015)"},{"key":"8_CR6","volume-title":"Embedded Computing: A VLIW Approach to Architecture, Compilers, and Tools","author":"JA Fisher","year":"2005","unstructured":"Fisher, J.A., Faraboschi, P., Young, C.: Embedded Computing: A VLIW Approach to Architecture, Compilers, and Tools. Morgan Kaufman, San Francisco (2005)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Furtak, T., Amaral, J.N., Niewiadomski, R.: Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms. In: SPAA 2007, pp. 348\u2013357. ACM (2007)","DOI":"10.1145\/1248377.1248436"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"CAR Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Comput. J. 5(1), 10\u201315 (1962)","journal-title":"Comput. J."},{"key":"8_CR9","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, New York (1973)"},{"key":"8_CR10","unstructured":"Lopez, B., Cruz-Cortes, N.: On the usage of sorting networks to big data. In: Arabnia, H.R., Yang, M.Q., Jandieri, G., Park, J.J., Solo, A.M.G., Tinetti, F.G., (eds.) Advances in Big Data Analytics: The 2014 WorldComp International Conference Proceedings. Mercury Learning and Information (2014)"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02090393","volume":"24","author":"I Parberry","year":"1991","unstructured":"Parberry, I.: A computer-assisted optimal depth lower bound for nine-input sorting networks. Math. Syst. Theor. 24(2), 101\u2013116 (1991)","journal-title":"Math. Syst. Theor."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF00289467","volume":"7","author":"R Sedgewick","year":"1977","unstructured":"Sedgewick, R.: The analysis of quicksort programs. Acta Inf. 7, 327\u2013355 (1977)","journal-title":"Acta Inf."},{"key":"8_CR13","volume-title":"An Introduction to the Analysis of Algorithms","author":"R Sedgewick","year":"1996","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley-Longman, New York (1996)"},{"key":"8_CR14","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley, Reading (2011)","edition":"4"},{"key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58589-0","volume-title":"Processor Architecture: From Dataflow to Superscalar and Beyond","author":"J Silc","year":"1999","unstructured":"Silc, J., Robic, B., Ungerer, T.: Processor Architecture: From Dataflow to Superscalar and Beyond. Springer, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27436-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T20:06:29Z","timestamp":1559333189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27436-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319274355","9783319274362"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27436-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}