The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing

Dades bibliogràfiques

Publicat a:	arXiv.org (Jul 18, 2018), p. n/a
Autor principal:	Boyar, Joan
Altres autors:	Faith, Ellen, Larsen, Kim S
Publicat:	Cornell University Library, arXiv.org
Matèries:	Algorithms Distributed shared memory Competition Lower bounds Randomization Combinatorial analysis Distributed memory Schedules Adaptive algorithms
Accés en línia:	Citation/Abstract Full text outside of ProQuest
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!