{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:38Z","timestamp":1750308218574,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,27]],"date-time":"2004-06-27T00:00:00Z","timestamp":1088294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,27]]},"DOI":"10.1145\/1007912.1007936","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"151-159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling against an adversarial network"],"prefix":"10.1145","author":[{"given":"Stefano","family":"Leonardi","sequence":"first","affiliation":[{"name":"Universit\u00e1 di Roma \"La Sapienza\""}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[{"name":"Universit\u00e1 di Roma \"La Sapienza\""}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[{"name":"University of Paderborn"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00266-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970037446X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(97)00037-X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338604"},{"key":"e_1_3_2_1_5_1","volume-title":"October","author":"Bonorden Olaf","year":"2002","unstructured":"Olaf Bonorden , Joachim Gehweiler , Pawel Olszta , and Rolf Wanka . PUB-Library-User Guide and Function Reference. Available at http:\/\/www.upb.de\/~pub , October 2002 . Olaf Bonorden, Joachim Gehweiler, Pawel Olszta, and Rolf Wanka. PUB-Library-User Guide and Function Reference. Available at http:\/\/www.upb.de\/~pub, October 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(02)00218-1"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 2001 USENIX Technical Conference, http:\/\/www.engr.uky.edu\/dieter\/publications.html","author":"William","year":"2001","unstructured":"William R. Dieter and James E. Lumpp, Jr. User-level checkpointing for linuxt reads programs . In Proceedings of the 2001 USENIX Technical Conference, http:\/\/www.engr.uky.edu\/dieter\/publications.html , June 2001 . William R. Dieter and James E. Lumpp, Jr. User-level checkpointing for linuxt reads programs. In Proceedings of the 2001 USENIX Technical Conference, http:\/\/www.engr.uky.edu\/dieter\/publications.html, June 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.679216"},{"key":"e_1_3_2_1_9_1","unstructured":"distributed. net project omepage. http:\/\/www.distributed.net.  distributed. net project omepage. http:\/\/www.distributed.net."},{"key":"e_1_3_2_1_10_1","unstructured":"Folding@home project homepage. http:\/\/folding.stanford.edu.  Folding@home project homepage. http:\/\/folding.stanford.edu."},{"key":"e_1_3_2_1_11_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey and D.S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman and Company , New York , New York, 1979 . M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, New York, 1979."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255722"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646508.694504"},{"key":"e_1_3_2_1_14_1","volume-title":"36th Annual Symposium on Foundations of Computer Science: October 23-25, 1995, Milwaukee, Wisconsin, pages 214--221, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA","author":"Kalyanasundaram B.","year":"1995","unstructured":"B. Kalyanasundaram and K. Pruhs . Speed is as powerful as clairvoyance {scheduling problems}. In IEEE, editor , 36th Annual Symposium on Foundations of Computer Science: October 23-25, 1995, Milwaukee, Wisconsin, pages 214--221, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA , 1995 . IEEE Computer Society Press. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance {scheduling problems}. In IEEE, editor, 36th Annual Symposium on Foundations of Computer Science: October 23-25, 1995, Milwaukee, Wisconsin, pages 214--221, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1995. IEEE Computer Society Press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/314500.314871"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797326241"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103453"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/191525.191541"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/135419.135465"},{"key":"e_1_3_2_1_21_1","unstructured":"Paderborn University BSP Library. http:\/\/www.upb.de\/~pub.  Paderborn University BSP Library. http:\/\/www.upb.de\/~pub."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645611.662055"},{"key":"e_1_3_2_1_23_1","unstructured":"Seti@home project homepage. http:\/\/setiathome.ssl.berkeley.edu.  Seti@home project homepage. http:\/\/setiathome.ssl.berkeley.edu."}],"event":{"name":"SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Barcelona Spain","acronym":"SPAA04"},"container-title":["Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007936","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007912.1007936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:15Z","timestamp":1750264275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,27]]},"references-count":22,"alternative-id":["10.1145\/1007912.1007936","10.1145\/1007912"],"URL":"https:\/\/doi.org\/10.1145\/1007912.1007936","relation":{},"subject":[],"published":{"date-parts":[[2004,6,27]]},"assertion":[{"value":"2004-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}