@inproceedings{ddb4340e137644d697d3246caf5277fa,
title = "Halvers and expanders (switching)",
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.",
author = "Mikl{\'o}s Ajtai and Janos Komlos and Endre Szemeredi",
note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 ; Conference date: 24-10-1992 Through 27-10-1992",
year = "1992",
doi = "10.1109/SFCS.1992.267782",
language = "English (US)",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "686--692",
booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",
address = "United States",
}