Abstract
Abdulraouf Y Al-Hallaq
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
Parallel processing with the perfect shuffle
10.1109/t-c.1971.223205 · 1971
A shuffle/exchange network with simplified control
10.1109/tc.1976.5009205 · 1976
Notes on shuffle/exchange — type switching networks
10.1109/tc.1980.1675553 · 1980
The universality of the shuffle/exchange network
10.1109/tc.1981.1675790 · 1981
Rearrangability of five-stage shuffle/exchange networks for N=8
10.1109/tcom.1987.1096867 · 1987
Rearrangeability of 2logN−1 shuffle/exchange network
1989
Access and alignment of data in an array processor
10.1109/t-c.1975.224157 · 1975
On a class of multistage interconnection networks
10.1109/tc.1980.1675651 · 1980
10.1109/c-m.1981.220290
10.1109/c-m.1981.220290
On the relation between Lee's proof of rearrangeability and the classical Benes–Slepian–Duguid theorem
1986
10.1016/0020-0255(87)90034-x
10.1016/0020-0255(87)90034-x
Generalized passability and robustness of the self-routing control algorithm for the base-line network
1987
Isomorphism of conflict graphs in multistage interconnection networks and its application to optimal routing
10.1109/12.277286 · 1993
New bound on the reliability of augmented shuffle-exchange networks
10.1109/12.368004 · 1995
Unresolved referenced work
Kept as external metadata until matched
On the number of permutations performable by extra-stage multistage interconnection networks
1987
Hierarchical classification of permutation classes in multistage interconnection networks
10.1109/12.338106 · 1994
Rearrangeability of 2(log N)−1 stages permutation networks
1985
Classifying and counting the permutations passable by the extra-stage multistage interconnection networks
1998
No additional external references are available.