A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing

Ran Libeskind-Hadas. A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. IEEE Transactions on Computers, 47(10):1158-1160, 1998.

Authors

Ran Libeskind-Hadas

This author has not been identified. Look up 'Ran Libeskind-Hadas' in Google