Opening book details…
About this scholarly article
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98 - Deadlock-free routing in arbitrary networks via the flattest common supersequence method by Laing, Ambrose K.; Cypher, Robert is a scholarly article available to read on EtoBox.
- Author
- Laing, Ambrose K.; Cypher, Robert
- Publisher
- ACM Press
- Published
- 1998
- Language
- EN