"The complexity of routing in Clos permutation networks."

David M. Koppelman, A. Yavuz Oruç (1994)

> Home

Details and statistics

DOI: 10.1109/18.272499

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/KoppelmanO94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/KoppelmanO94
David M. Koppelman, A. Yavuz Oruç:
The complexity of routing in Clos permutation networks. IEEE Trans. Inf. Theory 40(1): 278-284 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.