Control Algorithms for Rearrangeable Clos Networks
- 1 August 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 31 (8) , 952-954
- https://doi.org/10.1109/tcom.1983.1095923
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A self routing Benes networkPublished by Association for Computing Machinery (ACM) ,1980
- Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used PermutationsIEEE Transactions on Computers, 1978
- The Looping Algorithm Extended to Base 2tRearrangeable Switching NetworksIEEE Transactions on Communications, 1977
- On Neiman's Algorithm for the Control of Rearrangeable Switching NetworksIEEE Transactions on Communications, 1974
- Decomposition of Permutation NetworksIEEE Transactions on Computers, 1973
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971
- A Permutation NetworkJournal of the ACM, 1968
- Some Generalizations of the Problem of Distinct RepresentativesCanadian Journal of Mathematics, 1958
- TWO THEOREMS IN GRAPH THEORYProceedings of the National Academy of Sciences, 1957
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935