Halvers and Expanders
Halvers and Expanders
复制标题
减半器和扩展器
DOI:
--
复制
发表时间:
1992
期刊:
影响因子:
--
通讯作者:
E. Szemerédi
中科院分区:
文献类型:
--
作者:
M. Ajtai;J. Komlos;E. Szemerédi
We investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. We improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial cicuits whose basic units are k-sorter switches.