Conference paper
Finding a minimum circuit in a graph
Alon Itai, Michael Rodeh
STOC 1977
A layout for the shuffle-exchange network with O(N2/log3/2N) area is described. The layout combines ideas proposed by Thompson, Hoey, and Leiseron, and Prepara ta and Vuillemin. An interesting feature of the layout is that both the shuffle and the exchange edges have the same average length. Index Terms-Bisection, layout, permutation network shuffle-exchange. Copyright © 1981 by The Institute of Electrical and Electronics Engineers, Inc.
Alon Itai, Michael Rodeh
STOC 1977
Alon Itai, Michael Rodeh
FOCS 1984
David Bernstein, Michael Rodeh, et al.
Journal of Algorithms
David Steinberg, Michael Rodeh
Information Processing Letters