Review/Citation: Ebenlendr, Tomáš, Sgall, J. A lower bound on deterministic online algorithms for scheduling on related machines without preemption. emTheory of Computing Systems. /em 2015, 56(1), 73-81. ISSN 1432-4350
Requested document: Ebenlendr.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.