"Deadlock-Free Routing in Arbitrary Networks via the Flattest Common ..."

Ambrose Kofi Laing, Robert Cypher (1998)

> Home

Details and statistics

DOI: 10.1145/277651.277671

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spaa/LaingC98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/LaingC98
Ambrose Kofi Laing, Robert Cypher:
Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method. SPAA 1998: 55-66

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.