%0 Book Section %1 haddar11_12 %A Al-Haj Baddar, Sherenaz W. %A Batcher, Kenneth E. %B Designing Sorting Networks %D 2011 %I Springer New York %K algorithm baddar.batcher sorting sorting.network textbook %P 81-85 %R 10.1007/978-1-4614-1851-1_12 %T Ideas for Faster Networks %X We have already seen, in Chap. 9, that there is a gap in the number of steps between the fastest-known network and the information-theoretic lower bound. Thus, while trying to find a faster %& 12 %@ 978-1-4614-1850-4

@inbook{haddar11_12, abstract = {We have already seen, in Chap. 9, that there is a gap in the number of steps between the fastest-known network and the information-theoretic lower bound. Thus, while trying to find a faster }, added-at = {2014-04-20T01:08:40.000+0200}, author = {Al-Haj Baddar, Sherenaz W. and Batcher, Kenneth E.}, biburl = {https://www.bibsonomy.org/bibtex/28dc11f33785e5dceaff9a1e47464bca8/ytyoun}, booktitle = {Designing Sorting Networks}, chapter = 12, doi = {10.1007/978-1-4614-1851-1_12}, interhash = {1447fa2513c1ce2d8cec430719c7409f}, intrahash = {8dc11f33785e5dceaff9a1e47464bca8}, isbn = {978-1-4614-1850-4}, keywords = {algorithm baddar.batcher sorting sorting.network textbook}, language = {English}, pages = {81-85}, publisher = {Springer New York}, timestamp = {2016-10-27T12:47:28.000+0200}, title = {Ideas for Faster Networks}, year = 2011 }