{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T01:23:01Z","timestamp":1769304181776,"version":"3.49.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200279","type":"print"},{"value":"9783319200286","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_17","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"167-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["New Bounds on Optimal Sorting Networks"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Ehlers","sequence":"first","affiliation":[]},{"given":"Mike","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"17_CR1","unstructured":"Baddar, S.W.A., Batcher, K.E.: A 12-step sorting network for 22 elements. Technical report 2008-05, Department of Computer Science, Kent State University (2008)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1142\/S0129626409000092","volume":"19","author":"SWA Baddar","year":"2009","unstructured":"Baddar, S.W.A., Batcher, K.E.: An 11-step sorting network for 18 elements. Parallel Process. Lett. 19(1), 97\u2013103 (2009)","journal-title":"Parallel Process. Lett."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1968 Spring Joint Computer Conference, Atlantic City, NJ, USA, 30 April\u20132 May 1968, AFIPS Conference Proceedings, vol. 32, pp. 307\u2013314. Thomson Book Company, Washington D.C (1968)","DOI":"10.1145\/1468075.1468121"},{"key":"17_CR4","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":"17_CR5","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. CoRR, abs\/1404.0948 (2014)","DOI":"10.1109\/SYNASC.2014.55"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Codish, M., Cruz-Filipe, L., Schneider-Kamp, P.: Sorting networks: the end game. CoRR, abs\/1411.6408 (2014)","DOI":"10.1007\/978-3-319-15579-1_52"},{"key":"17_CR7","first-page":"593","volume-title":"Genetic and Evolutionary Computation Conference, GECCO 2012","author":"D Coles","year":"2012","unstructured":"Coles, D.: Efficient filters for the simulated evolution of small sorting networks. In: Soule, T., Moore, J.H. (eds.) Genetic and Evolutionary Computation Conference, GECCO 2012, pp. 593\u2013600. ACM, Philadelphia (2012)"},{"key":"17_CR8","volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesly Professional, Reading (1998)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Lynce, I., Silva, J.P.M.: Probing-based preprocessing techniques for propositional satisfiability. In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), Sacramento, California, USA, 3\u20135 November 2003, p. 105. IEEE Computer Society (2003)","DOI":"10.1109\/TAI.2003.1250177"},{"issue":"2","key":"17_CR10","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":"17_CR11","first-page":"303","volume":"14","author":"VK Valsalam","year":"2013","unstructured":"Valsalam, V.K., Miikkulainen, R.: Using symmetry and evolutionary search to minimize sorting networks. J. Mach. Learn. Res. 14, 303\u2013331 (2013)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:09:29Z","timestamp":1748459369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}