{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:52:52Z","timestamp":1725483172871},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000730"},{"type":"electronic","value":"9783540361084"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36108-1_20","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:38:36Z","timestamp":1178224716000},"page":"295-310","source":"Crossref","is-referenced-by-count":6,"title":["Bounding Work and Communication in Robust Cooperative Computation"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Gasieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon, Eigenvalues and expanders, Combinatorica, 6 (1986) 83\u201396.","journal-title":"Combinatorica"},{"key":"20_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/3-540-45022-X_49","volume-title":"Proc., 27th Int. Colloquium on Automata, Languages and Programming","author":"N. Alon","year":"2000","unstructured":"N. Alon, H. Kaplan, M. Krivelevich, D. Malkhi, and J. Stern, Scalable secure storage when half the system is faulty, in Proc., 27th Int. Colloquium on Automata, Languages and Programming, 2000, Springer LNCS 1853, pp. 577\u2013587."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"N. Alon, and V.D. Milman, \u03bb1, isoperimetric inequalities for graphs, and super-concentrators, J. Combin. Theory Ser. B, 38 (1985) 73\u201388.","journal-title":"J. Combin. Theory Ser. B"},{"key":"20_CR4","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, Performing tasks on synchronous restartable message-passing processors, Distributed Computing, 14 (2001) 49\u201364.","journal-title":"Distributed Computing"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, and D.R. Kowalski, Gossiping to reach consensus, in Proc., 14th ACM Symp. on Parallel Algorithms and Architectures, 2002, Winnipeg, Manitoba, Canada, to appear.","DOI":"10.1145\/564870.564908"},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-48169-9_20","volume-title":"Proc. 13th Int. Symposium on Distributed Computing","author":"B.S. Chlebus","year":"1999","unstructured":"B.S. Chlebus, and D.R. Kowalski, Randomization helps to perform independent tasks reliably, submitted. A preliminary version appeared as: Randomization helps to perform tasks on processors prone to failures, in Proc. 13th Int. Symposium on Distributed Computing, 1999, Springer LNCS 1693, pp. 284\u2013296."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, D.R. Kowalski, and A. Lingas, The do-all problem in broadcast networks, in Proc., 20th ACM Symp. on Principles of Distributed Computing, 2001, Newport, Rhode Island, pp. 117\u2013126.","DOI":"10.1145\/383962.384000"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"A. Clementi, A. Monti, and R. Silvestri, Optimal f-reliable protocols for the do-all problem on single-hop wireless networks, in Proc., 13th Int. Symposium on Algorithms and Computation, 2002, to appear.","DOI":"10.1007\/3-540-36136-7_29"},{"key":"20_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5927-3","volume-title":"Multiplicative Number Theory","author":"H. Davenport","year":"1980","unstructured":"H. Davenport, \u201cMultiplicative Number Theory,\u201d 2nd ed. revised by H.L. Montgomery, Springer Verlag, Berlin, 1980.","edition":"2nd ed."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"R. De Prisco, A. Mayer, and M. Yung, Time-optimal message-efficient work performance in the presence of faults, in Proc. 13th ACM Symp. on Principles of Distributed Computing, 1994, pp. 161\u2013172.","DOI":"10.1145\/197917.198082"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s004530010030","volume":"28","author":"K. Diks","year":"2000","unstructured":"K. Diks, and A. Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes, Algorithmica, 28 (2000) 37\u201350.","journal-title":"Algorithmica"},{"key":"20_CR12","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, Performing work efficiently in the presence of faults, SIAM J. on Computing, 27 (1998) 1457\u20131491.","journal-title":"SIAM J. on Computing"},{"key":"20_CR13","unstructured":"A. Fiat and J. Saia, Censorship resistant peer-to-peer content addressable networks, in Proc., 13th ACM-SIAM Symp. on Discrete Algorithms, 2002."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Z. Galil, A. Mayer, and M. Yung, Resolving message complexity of byzantine agreement and beyond, in Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 724\u2013733.","DOI":"10.1109\/SFCS.1995.492674"},{"key":"20_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-45414-4_11","volume-title":"Proc., 15th Int. Symposium on Distributed Computing","author":"C. Georgiou","year":"2001","unstructured":"C. Georgiou, A. Russell, and A.A. Shvartsman, The complexity of synchronous iterative do-all with crashes, in Proc., 15th Int. Symposium on Distributed Computing, 2001, Springer LNCS 2180, pp. 151\u2013165."},{"key":"20_CR16","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. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing, 5 (1992) 201\u2013217.","journal-title":"Distributed Computing"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988) 261\u2013277.","journal-title":"Combinatorica"},{"key":"20_CR18","first-page":"71","volume":"9","author":"G.A. Margulis","year":"1973","unstructured":"G.A. Margulis, Explicit constructions of concentrators, Prob. Per. Infor. 9 (1973) 71\u201380; English transl. in Problems of Information Transmission, (1975) 325\u2013332.","journal-title":"Prob. Per. Infor."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0605030","volume":"5","author":"R.M. Tanner","year":"1984","unstructured":"R.M. Tanner, Explicit concentrators from generalized N-gons, SIAM J. Alg. Disc. Methods, 5 (1984) 287\u2013293.","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1006\/inco.1994.1099","volume":"115","author":"E. Upfal","year":"1994","unstructured":"E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Information and Computation, 115 (1994) 312\u2013320.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36108-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:19:34Z","timestamp":1550305174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36108-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000730","9783540361084"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36108-1_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}