%0 Conference Paper %1 267782 %A Ajtai, M. %A Komlós, J. %A Szemerédi, E. %B Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on %D 1992 %K aks algorithm expander halver sorting sorting.network %P 686--692 %R 10.1109/SFCS.1992.267782 %T Halvers and Expanders %X The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches

@inproceedings{267782, abstract = {The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches}, added-at = {2014-04-20T00:16:26.000+0200}, author = {Ajtai, M. and Koml\'{o}s, J. and Szemer{\'e}di, E.}, biburl = {https://www.bibsonomy.org/bibtex/2336ba87786b0a84f31514542e1d3172e/ytyoun}, booktitle = {Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on}, doi = {10.1109/SFCS.1992.267782}, interhash = {dcd9aaf6386fb9f3b3c39d5c0ac1d31a}, intrahash = {336ba87786b0a84f31514542e1d3172e}, keywords = {aks algorithm expander halver sorting sorting.network}, month = oct, pages = {686--692}, timestamp = {2016-11-04T13:46:00.000+0100}, title = {Halvers and Expanders}, year = 1992 }