Mostrar el registro sencillo del ítem

Asymptotic Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine

dc.contributor.authorZavou, Elli 
dc.date.accessioned2021-07-13T10:18:22Z
dc.date.available2021-07-13T10:18:22Z
dc.date.issued2014-07-07
dc.identifier.urihttp://hdl.handle.net/20.500.12761/1442
dc.description(Part of a collaborative work with A. Fernández Anta (1), C. Georgiou (3)and D.R. Kowalski (4)) 1 IMDEA Networks Institute, 2 Universidad Carlos III de Madrid, 3 University of Cyprus, 4 University of Liverpool
dc.language.isoeng
dc.titleAsymptotic Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machineen
dc.typeconference object
dc.conference.date7–11 July 2014
dc.conference.placeCopenhagen, Denmark
dc.conference.titleThe 41st International Colloquium on Automata, Languages and Programming (ICALP 2014)*
dc.event.typeconference
dc.pres.typeposter
dc.type.hasVersionVoR
dc.rights.accessRightsopen access
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/921


Ficheros en el ítem

Nombre:
YR-ICALP-poster-final.pdf
Tamaño:
688.0Kb
Formato:
PDF

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem