{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:54:28Z","timestamp":1743101668948,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"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_10","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T02:44:15Z","timestamp":1253673855000},"page":"63-77","source":"Crossref","is-referenced-by-count":7,"title":["Randomization Can Be a Healer: Consensus with Dynamic Omission Failures"],"prefix":"10.1007","author":[{"given":"Henrique","family":"Moniz","sequence":"first","affiliation":[]},{"given":"Nuno Ferreira","family":"Neves","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Correia","sequence":"additional","affiliation":[]},{"given":"Paulo","family":"Ver\u00edssimo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050070","volume":"13","author":"M. Aguilera","year":"2000","unstructured":"Aguilera, M., Chen, W., Toueg, S.: Failure detection and consensus in the crash-recovery model. Distributed Computing\u00a013(2), 99\u2013125 (2000)","journal-title":"Distributed Computing"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Akkoyunlu, E.A., Ekanadham, K., Huber, R.V.: Some constraints and tradeoffs in the design of network communications. In: Proceedings of the 5th ACM Symposium on Operating Systems Principles, pp. 67\u201374 (1975)","DOI":"10.1145\/800213.806523"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Biely, M., Widder, J., Charron-Bost, B., Gaillard, A., Hutle, M., Schiper, A.: Tolerating corrupted communication. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing, pp. 244\u2013253 (2007)","DOI":"10.1145\/1281100.1281136"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous $\\lfloor(n-1)\/3\\rfloor$ -resilient consensus protocol. In: Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pp. 154\u2013162 (1984)","DOI":"10.1145\/800222.806743"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C. Cachin","year":"2005","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Journal of Cryptology\u00a018(3), 219\u2013246 (2005)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"10_CR8","unstructured":"Charron-Bost, B., Schiper, A.: The heard-of model: Computing in distributed systems with benign failures. Technical Report LSR-REPORT-2007-001, EPFL (2007)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00446-008-0056-2","volume":"21","author":"G. Chockler","year":"2008","unstructured":"Chockler, G., Demirbas, M., Gilbert, S., Lynch, N., Newport, C., Nolte, T.: Consensus and collision detectors in radio networks. Distributed Computing\u00a021(1), 55\u201384 (2008)","journal-title":"Distributed Computing"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Dolev, D., Friedman, R., Keidar, I., Malkhi, D.: Failure detectors in omission failure environments. In: Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, pp. 286\u2013295 (1997)","DOI":"10.1145\/259380.259501"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-12689-9_99","volume-title":"Foundations of Computation Theory","author":"M.J. Fischer","year":"1983","unstructured":"Fischer, M.J.: The consensus problem in unreliable distributed systems (A brief survey). In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 127\u2013140. Springer, Heidelberg (1983)"},{"issue":"2","key":"10_CR13","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. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08755-9_9","volume-title":"Operating Systems: An Advanced Course","author":"J. Gray","year":"1978","unstructured":"Gray, J.: Notes on data base operating systems. In: Bayer, R., Graham, R.M., Seegm\u00fcller, G. (eds.) Operating Systems. LNCS, vol.\u00a060. Springer, Heidelberg (1978)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Hurfin, M., Mostefaoui, A., Raynal, M.: Consensus in asynchronous systems where processes can crash and recover. In: Proceedings of the the 17th IEEE Symposium on Reliable Distributed Systems, pp. 280\u2013286 (1998)","DOI":"10.1109\/RELDIS.1998.740510"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00446-006-0155-x","volume":"19","author":"L. Lamport","year":"2006","unstructured":"Lamport, L.: Lower bounds for asynchronous consensus. Distributed Computing\u00a019(2), 104\u2013125 (2006)","journal-title":"Distributed Computing"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR18","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1997","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Moniz, H., Neves, N.F., Correia, M., Ver\u00edssimo, P.: Experimental comparison of local and shared coin randomized consensus protocols. In: Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems, pp. 235\u2013244 (2006)","DOI":"10.1109\/SRDS.2006.19"},{"key":"10_CR20","unstructured":"Moniz, H., Neves, N.F., Correia, M., Ver\u00edssimo, P.: RITAS: Services for randomized intrusion tolerance. In: IEEE Transactions on Dependable and Secure Computing (to appear, 2009)"},{"issue":"12","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1109\/TPDS.2005.153","volume":"16","author":"N.F. Neves","year":"2005","unstructured":"Neves, N.F., Correia, M., Ver\u00edssimo, P.: Solving vector consensus with a wormhole. IEEE Transactions on Parallel and Distributed Systems\u00a016(12), 1120\u20131131 (2005)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR22","unstructured":"Oliveira, R., Guerraoui, R., Schiper, A.: Consensus in the crash-recover model. Technical Report 97-239, EPFL (1997)"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K.J. Perry","year":"1986","unstructured":"Perry, K.J., Toueg, S.: Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering\u00a012(3), 477\u2013482 (1986)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized Byzantine generals. In: Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Raynal, M., Roy, M.: A note on a simple equivalence between round-based synchronous and asynchronous models. In: Proceedings of the 11th IEEE Pacific Rim International Symposium on Dependable Computing, pp. 387\u2013392 (2005)","DOI":"10.1109\/PRDC.2005.10"},{"issue":"2-3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.tcs.2007.04.036","volume":"384","author":"N. Santoro","year":"2007","unstructured":"Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. Theoretical Computer Science\u00a0384(2-3), 232\u2013249 (2007)","journal-title":"Theoretical Computer Science"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Proceedings of the 6th Symposium on Theoretical Aspects of Computer Science, pp. 304\u2013313 (1989)","DOI":"10.1007\/BFb0028994"},{"issue":"5","key":"10_CR29","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1137\/S009753970443999X","volume":"38","author":"U. Schmid","year":"2009","unstructured":"Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM Journal on Computing\u00a038(5), 1912\u20131951 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1996.0063","volume":"128","author":"G. Varghese","year":"1996","unstructured":"Varghese, G., Lynch, N.A.: A tradeoff between safety and liveness for randomized coordinated attack. Information and Computation\u00a0128(1), 57\u201371 (1996)","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\/978-3-642-04355-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T09:04:17Z","timestamp":1739351057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}