{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:06:24Z","timestamp":1729641984595,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/reconfig.2017.8279784","type":"proceedings-article","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T22:32:24Z","timestamp":1517869944000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Deriving concentrators from binary sorters using half cleaners"],"prefix":"10.1109","author":[{"given":"Tripti","family":"Jain","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Ankesh","family":"Jain","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1971.tb02569.x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675960"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1109\/TCOMM.1994.580197","article-title":"A recursive concentrator structure with applications to self-routing switching networks","volume":"42","year":"1994","journal-title":"IEEE Transactions on Communications"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/26.7538"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/800094.803052"},{"key":"ref34","first-page":"318:1","article-title":"On the complexity of a concentrator","author":"pinsker","year":"1973","journal-title":"International Teletraffic Conference (ITC)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2014.36"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/12.509917"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/71.285603"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/26.328986"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/71.342124"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1979.tb02972.x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1953.tb01433.x"},{"journal-title":"Principles and Practices of Interconnection Networks","year":"2004","author":"dally","key":"ref17"},{"journal-title":"Faster sorting networks for 17 19 and 20 inputs","year":"2014","author":"ehlers","key":"ref18"},{"journal-title":"New bounds on optimal sorting networks","year":"2015","key":"ref19"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/26.380083","article-title":"Design of efficient and easily routable generalized connectors","volume":"43","author":"lee","year":"1995","journal-title":"IEEE Transactions on Communications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.09.004"},{"key":"ref27","first-page":"412","article-title":"On the rearrangeability of (2 log(N)-1) stage permutation networks","volume":"34","author":"lee","year":"1985","journal-title":"IEEE Transactions on Computers (T-C)"},{"journal-title":"Optimal-depth sorting networks","year":"2014","author":"bundala","key":"ref3"},{"journal-title":"Optimal sorting networks","year":"2013","author":"bundala","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/71.372780"},{"journal-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","year":"1965","author":"bene\u0161","key":"ref5"},{"key":"ref8","first-page":"557","article-title":"Rearrangeability of (2n-1)-stage shuffle-exchange networks","volume":"32","author":"cam","year":"2003","journal-title":"SIAM J Control Optim (SICON)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04921-2_19"},{"key":"ref2","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"batcher","year":"1968","journal-title":"AFIPS Spring Joint Computer Conference"},{"journal-title":"Sorting networks to the end and back again","year":"2015","author":"codish","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90040-4"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1109\/12.260636","article-title":"Fast self-routing permutation switching on an asymptotically minimum cost network","volume":"42","author":"jan","year":"1993","journal-title":"IEEE Transactions on Computers"},{"key":"ref21","first-page":"121","article-title":"Starlite: A wideband digital switch","author":"huang","year":"1984","journal-title":"Global Telecommunications Conference (GLOBECOM)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3139540.3139546"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2016.7797744"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224157"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90023-I"}],"event":{"name":"2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","start":{"date-parts":[[2017,12,4]]},"location":"Cancun","end":{"date-parts":[[2017,12,6]]}},"container-title":["2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8268902\/8279767\/08279784.pdf?arnumber=8279784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T09:09:09Z","timestamp":1570698549000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8279784\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/reconfig.2017.8279784","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}