Search results
- 1.0318801 - MÚ 2009 RIV CZ eng O - Others
Ebenlendr, Tomáš - Sgall, Jiří
Semi-online preemptive scheduling: One algorithm for all variants; KAM-DIMATIA Series 2008-895 and ITI Series 2008-416.
[Semi-online preemptivní rozvrhování: Jeden algoritmus pro všechny varianty.]
2008
R&D Projects: GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0168118 - 2.0318602 - MÚ 2009 RIV CZ eng O - Others
Ebenlendr, Tomáš - Sgall, Jiří
A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417.
[Dolní odhad pro rozvrhování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích.]
2008
R&D Projects: GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0167972 - 3.0089738 - MÚ 2008 RIV CZ eng O - Others
Gál, A. - Koucký, Michal - McKenzie, P.
Incremental branching programs.
Praha: ECCC, Electronic Colloquium on Computational Complexity, 2005. TR05-136.
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : branching programs * models of computation * lower bounds
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0150847File Download Size Commentary Version Access Koucky.pdf 1 217.8 KB Publisher’s postprint open-access