The buffer minimization problem for multiprocessor scheduling with conflicts
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F01%3A00105563" target="_blank" >RIV/00216208:11320/01:00105563 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The buffer minimization problem for multiprocessor scheduling with conflicts
Original language description
The buffer minimization problem for multiprocessor scheduling with conflicts
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F99%2F0242" target="_blank" >GA201/99/0242: DIMATIA - center of discrete mathematics, theoretical computer science and applications</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
International Colloquium on Automata, Languages and Programming, 28th symposium
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
862-874
Publisher name
Springer
Place of publication
Heidelberg
Event location
Heidelberg
Event date
Jan 1, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—