%0 Book Section %1 haddar11_10 %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 61-71 %R 10.1007/978-1-4614-1851-1_10 %T Lattice Theory %X Sometimes analyzing a poset of keys doesn’t give us a complete picture of what’s happening in a given sorting network. Here, we showed an example of bitonic merging to prove that sometimes analyzing the 0/1-cases is better than analyzing the poset of keys. In our example we considered two different ways to construct exactly the same key poset: the CL lists in Figs. 10.16 and 10.18. It turned out that they both have the same key poset. However, the CL in Fig. 10.16 generated 21 cases whereas the CL in Fig. 10.18 generated 31 cases. This due to the fact Sortnet operates in the reverse direction—it first generates the set of 0/1-cases for a particular situation and then generates the poset of the keys from the set of 0/1-cases using the following rule: %& 10 %@ 978-1-4614-1850-4

@inbook{haddar11_10, abstract = {Sometimes analyzing a poset of keys doesn’t give us a complete picture of what’s happening in a given sorting network. Here, we showed an example of bitonic merging to prove that sometimes analyzing the 0/1-cases is better than analyzing the poset of keys. In our example we considered two different ways to construct exactly the same key poset: the CL lists in Figs. 10.16 and 10.18. It turned out that they both have the same key poset. However, the CL in Fig. 10.16 generated 21 cases whereas the CL in Fig. 10.18 generated 31 cases. This due to the fact Sortnet operates in the reverse direction—it first generates the set of 0/1-cases for a particular situation and then generates the poset of the keys from the set of 0/1-cases using the following rule:}, added-at = {2014-04-20T01:05:07.000+0200}, author = {Al-Haj Baddar, Sherenaz W. and Batcher, Kenneth E.}, biburl = {https://www.bibsonomy.org/bibtex/2e9ea52020558ffe97dd5bb5b725b01ba/ytyoun}, booktitle = {Designing Sorting Networks}, chapter = 10, doi = {10.1007/978-1-4614-1851-1_10}, interhash = {52a9990e5dc6aeb83850c65c6eddba04}, intrahash = {e9ea52020558ffe97dd5bb5b725b01ba}, isbn = {978-1-4614-1850-4}, keywords = {algorithm baddar.batcher sorting sorting.network textbook}, language = {English}, pages = {61-71}, publisher = {Springer New York}, timestamp = {2016-10-27T12:47:07.000+0200}, title = {Lattice Theory}, year = 2011 }