Number of the records: 1
Semi-online preemptive scheduling: one algorithm for all variants
- 1.Ebenlendr, Tomáš - Sgall, J.
Semi-online preemptive scheduling: one algorithm for all variants.
Theory of Computing Systems. Roč. 48, č. 3 (2011), s. 577-613. ISSN 1432-4350. E-ISSN 1433-0490.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, 26.02.2009-28.02.2009]
Impact factor: 0.442, year: 2011
http://www.springerlink.com/content/k66u6tv1l7731654/
http://hdl.handle.net/11104/0204123
Number of the records: 1