{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T05:24:59Z","timestamp":1738733099072,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_29","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T19:07:11Z","timestamp":1227640031000},"page":"320-331","source":"Crossref","is-referenced-by-count":7,"title":["Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks"],"prefix":"10.1007","author":[{"given":"Andrea E. F.","family":"Clementi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Monti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"29_CR1","series-title":"Lect Notes Comput Sci","volume-title":"13th DISC\u201999","author":"B.S. Chlebus","year":"1999","unstructured":"B.S. Chlebus, D.R. Kowalski (1999). Randomization helps to perform tasks on processors prone to failures. 13th DISC\u201999, LNCS, 1693."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, D.R. Kowalski, and A. Lingas (2001). The Do-All problem in Broadcast networks, ACM-PODC\u201901.","DOI":"10.1145\/383962.384000"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/PL00008926","volume":"14","author":"B.S. Chlebus","year":"2001","unstructured":"B.S. Chlebus, R. De Prisco, and A.A. Shvartsman (2001). Performing tasks on synchronous restartable message-passing processors. Distributed Computing, 14, 49\u201364.","journal-title":"Distributed Computing"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/S0097539793255527","volume":"27","author":"C. Dwork","year":"1998","unstructured":"C. Dwork, J. Halpern, and O. Waarts (1998). Performing work efficiently in the presence of faults, SIAM J. on Computing, 27, 1457\u20131491.","journal-title":"SIAM J. on Computing"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"R. De Prisco, A. Mayer, and M. Yung (1994). Time-optimal message-efficient work performance in the presence of faults, ACM PODC\u201994, 161\u2013172.","DOI":"10.1145\/197917.198082"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Z. Galil, A. Mayer, and M. Yung (1995). Resolving message complexity of byzantine agreement and beyond, IEEE FOCS\u201995, 724\u2013733.","DOI":"10.1109\/SFCS.1995.492674"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"D. Gelernter and D. Kaminsky (1992). Supercomputing out of recycled garbage: preliminary experience with Piranha. ACM Int. Conf. on Supercomputing, 417\u2013427.","DOI":"10.1145\/143369.143444"},{"key":"29_CR8","unstructured":"J.D. Gibson (Ed.) (1996). The Mobile Communications Handbook, CRC Press."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P.C. Kanellakis","year":"1992","unstructured":"P.C. Kanellakis, and A.A. Shavartsman (1992). Efficient Parallel Algorithms Can Be Made Robust, Distributed Computing,5, 201\u2013217.","journal-title":"Distributed Computing"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis, and A.A. Shavartsman (1997) Fault-Tolerant Parallel Computation, ISBN 0-7923-9922-6, Klunder Academic Publishers.","DOI":"10.1007\/978-1-4757-5210-6"},{"key":"29_CR11","first-page":"95","volume":"25","author":"J.F. Shoch","year":"1982","unstructured":"J.F. Shoch and J.A. Hupp (1982). The Worm programs \u2014 early experience with a distributed computation, Comm. Assoc. Comput. Mach., 25, 95\u2013103.","journal-title":"Comm. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T17:06:32Z","timestamp":1738688792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}