"A Tight Lower Bound on the Number of Channels Required for Deadlock-Free ..."

Ran Libeskind-Hadas (1998)

> Home

Details and statistics

DOI: 10.1109/12.729799

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  authority control:
- export record
  dblp key:
  - journals/tc/Libeskind-Hadas98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/Libeskind-Hadas98
Ran Libeskind-Hadas:
A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. IEEE Trans. Computers 47(10): 1158-1160 (1998)

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.