uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Feasibility of fork-join real-time task graph models: Hardness and algorithms
Show others and affiliations
2016 (English)In: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 15, no 1, 14Article in journal (Refereed) Published
Resource type
Text
Place, publisher, year, edition, pages
2016. Vol. 15, no 1, 14
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:uu:diva-296790DOI: 10.1145/2809780ISI: 000373654000014OAI: oai:DiVA.org:uu-296790DiVA: diva2:939833
Available from: 2016-02-20 Created: 2016-06-20 Last updated: 2017-03-17Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Guan, NanYi, Wang
By organisation
Computer Systems
In the same journal
ACM Transactions on Embedded Computing Systems
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 195 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf