Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
EnglishSvenskaNorsk
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
Complexity of partitioned scheduling for periodic tasks
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computer Systems. (Embedded systems)
2022 (English)Conference paper, Oral presentation with published abstract (Refereed)
Place, publisher, year, edition, pages
2022.
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-489148OAI: oai:DiVA.org:uu-489148DiVA, id: diva2:1713984
Conference
The 15th Workshop on Models and Algorithms for Planning and Scheduling (MAPSP)
Available from: 2022-11-28 Created: 2022-11-28 Last updated: 2022-11-28

Open Access in DiVA

No full text in DiVA

Search in DiVA

By author/editor
Ekberg, Pontus
By organisation
Computer SystemsDivision of Computer Systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 35 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
v. 2.46.0
|
WCAG
|
Uppsala University Library
|
Ask the Library
|
Log in to DiVA
|
Search and link in DiVA