Name
Abstract | ||
|---|---|---|
It is proved that the 2 log N-1 S/E (shuffle/exchange) network is rearrangeable for all N. This proof combines the concept of functional equivalence and K.Y. Lee's (1985) proof of rearrangeability. A routing algorithm emerges as a natural result for passing any arbitrary permutation |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1109/TAI.1989.65356 | Fairfax, VA |
Keywords | Field | DocType |
neural nets,arbitrary permutation,functional equivalence,rearrangeability,routing algorithm,shuffle/exchange network,routing,sorting,switches,computer networks | Functional equivalence,Binary logarithm,Discrete mathematics,Computer science,Permutation,Artificial neural network,Distributed computing,Routing algorithm | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Al-Hallaq, A.Y. | 1 | 0 | 0.34 |
| Abdulraouf Y. Al-Hallaq | 2 | 0 | 0.68 |