"The Computational Complexity of Feasibility Analysis for Conditional DAG ..."

Sanjoy K. Baruah, Alberto Marchetti-Spaccamela (2023)

> Home

Details and statistics

DOI: 10.1145/3606342

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/topc/BaruahM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/topc/BaruahM23
Sanjoy K. Baruah, Alberto Marchetti-Spaccamela:
The Computational Complexity of Feasibility Analysis for Conditional DAG Tasks. ACM Trans. Parallel Comput. 10(3): 14:1-14:22 (2023)

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.