{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:01:55Z","timestamp":1743069715171,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_6","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T02:44:15Z","timestamp":1253673855000},"page":"8-21","source":"Crossref","is-referenced-by-count":9,"title":["The Disagreement Power of an Adversary"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Tielmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized flp impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91\u2013100 (1993)","DOI":"10.1145\/167088.167119"},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M.E. Saks","year":"2000","unstructured":"Saks, M.E., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput.\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: PODC, pp. 311\u2013324 (1990)","DOI":"10.1145\/93385.93431"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E. Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distributed Computing\u00a014(3), 127\u2013146 (2001)","journal-title":"Distributed Computing"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks (extended abstract). In: STOC, pp. 589\u2013598 (1997)","DOI":"10.1145\/258533.258652"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Junqueira, F.P., Marzullo, K.: Designing algorithms for dependent process failures. In: Future Directions in Distributed Computing, pp. 24\u201328 (2003)","DOI":"10.1007\/3-540-37795-6_5"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.M.: Efficient byzantine agreement secure against general adversaries. In: DISC, pp. 134\u2013148 (1998)","DOI":"10.1007\/BFb0056479"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Ashwinkumar, B.V., Patra, A., Choudhary, A., Srinathan, K., Rangan, C.P.: On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. In: PODC, pp. 115\u2013124 (2008)","DOI":"10.1145\/1400751.1400768"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Zielinski, P.: Anti-Omega: the weakest failure detector for set agreement. In: PODC, pp. 55\u201364 (2008)","DOI":"10.1145\/1400751.1400761"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/S0097539798344367","volume":"34","author":"T.D. Chandra","year":"2004","unstructured":"Chandra, T.D., Hadzilacos, V., Jayanti, P., Toueg, S.: Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus. SIAM J. Comput.\u00a034(2), 333\u2013357 (2004)","journal-title":"SIAM J. Comput."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. In: PODC, pp. 147\u2013158 (1992)","DOI":"10.21236\/ADA253611"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Lo, W.K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems (extended abstract). In: WDAG, pp. 280\u2013295 (1994)","DOI":"10.1007\/BFb0020440"},{"key":"6_CR15","first-page":"233","volume-title":"SFCS","author":"P.M.B. Vitanyi","year":"1986","unstructured":"Vitanyi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: SFCS, Washington, DC, USA, pp. 233\u2013243. IEEE Computer Society Press, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T09:04:20Z","timestamp":1739351060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}