Number of the records: 1
Semi-online preemptive scheduling: one algorithm for all variants
- 1.Ebenlendr, Tomáš - Sgall, Jiří
Semi-online preemptive scheduling: one algorithm for all variants.
26th International Symposium on Theoretical Aspects of Computer Science. Leibniz: Schloss Dagstuhl, 2009 - (Albers, S.; Marion, J.), s. 349-360. ISBN 978-3-939897-09-5.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg (DE), 26.02.2009-28.02.2009]
http://hdl.handle.net/11104/0179568
Number of the records: 1