"Optimal Sequentialization of Gated Data Dependence Graphs is NP-Complete."

Eben Upton (2003)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2003-10-08

- no documents available
- export record
  dblp key:
  - conf/pdpta/Upton03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pdpta/Upton03
Eben Upton:
Optimal Sequentialization of Gated Data Dependence Graphs is NP-Complete. PDPTA 2003: 1767-1770

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.