{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:49Z","timestamp":1725512149485},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72951-8_24","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T00:03:25Z","timestamp":1183334605000},"page":"304-317","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Conclusive Sets for Comparator Networks"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamir","family":"Levi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ami","family":"Litman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Batcher, K.E.: Sorting Networks and their Applications. In: Proc. AFIPS Spring Joint Computer Conference, vol.\u00a032, pp. 307\u2013314 (1968)"},{"key":"24_CR2","unstructured":"Even, G., Levi, T., Litman, A.: A complete characterization of functions that commute with monotonic functions (in preparation)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bender, E.A., Williamson, S.G.: Periodic Sorting Using Minimum Delay Recursively Constructed Merging Networks. Electronic Journal Of Combinatorics 5 (1998)","DOI":"10.37236\/1343"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A Decomposition Theorem for Partially Ordered Sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"24_CR5","volume-title":"The art of computer programming Sorting and searching, vol. 3","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming Sorting and searching, vol. 3. Addison-Wesley, London (1973)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/71.342136","volume":"6","author":"D.L. Lee","year":"1995","unstructured":"Lee, D.L., Batcher, K.E.: A Multiway merge sorting network. IEEE Transactions on Parallel and Distributed Systems\u00a06, 211\u2013215 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"24_CR7","unstructured":"Levi, T.: Minimal depth merging networks. M.Sc. Thesis, Technion (March 2006)"},{"key":"24_CR8","unstructured":"Liszka, K.J., Batcher, K.E.: A Modulo merge sorting network. In: Symposium on the Frontiers of Massively Parallel Computation (1992)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(66)80035-2","volume":"1","author":"D. Lubell","year":"1966","unstructured":"Lubell, D.: A short proof of Sperner\u2019s theorem. J. Combin. Theory\u00a01, 299 (1966)","journal-title":"J. Combin. Theory"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/227595.227693","volume":"43","author":"P.B. Miltersen","year":"1996","unstructured":"Miltersen, P.B., Paterson, M., Tarui, J.: The asymptotic complexity of merging networks. J. ACM\u00a043(1), 147\u2013165 (1996)","journal-title":"J. ACM"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/12.16506","volume":"38","author":"T. Nakatani","year":"1989","unstructured":"Nakatani, T., et al.: K-way bitonic Sort. IEEE Trans. on Computers\u00a038, 283\u2013288 (1989)","journal-title":"IEEE Trans. on Computers"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ipl.2004.11.013","volume":"94","author":"S. Rajasekaran","year":"2005","unstructured":"Rajasekaran, S., Sen, S.: A generalization of the 0-1 principle for Sorting. IPL\u00a094, 43\u201347 (2005)","journal-title":"IPL"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-8641(97)00155-7","volume":"85","author":"W.D. Rice","year":"1998","unstructured":"Rice, W.D.: Continuous Algorithms. Topology Appl.\u00a085, 299\u2013318 (1998)","journal-title":"Topology Appl."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T22:37:09Z","timestamp":1587681429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729181","9783540729518"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}