{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:38:14Z","timestamp":1725507494169},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770954"},{"type":"electronic","value":"9783540770961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77096-1_19","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T07:44:46Z","timestamp":1207899886000},"page":"260-273","source":"Crossref","is-referenced-by-count":1,"title":["N-Consensus is the Second Strongest Object for N\u2009+\u20091 Processes"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","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(3), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"19_CR3","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. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"issue":"2","key":"19_CR4","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":"19_CR5","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: On the robustness of Herlihy\u2019s hierarchy. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 145\u2013158 (August 1993)","DOI":"10.1145\/164051.164070"},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, Chichester (2004)","edition":"2"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E., Afek, Y.: Consensus power makes (some) sense! In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 363\u2013372 (August 1994)","DOI":"10.1145\/197917.198126"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Neiger, G.: Failure detectors and the wait-free hierarchy. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 100\u2013109 (August 1995)","DOI":"10.1145\/224964.224976"},{"key":"19_CR9","unstructured":"Ruppert, E.: The Consensus Power of Shared-Memory Distributed Systems. PhD thesis, University of Toronto (1999)"},{"key":"19_CR10","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 163\u2013183 (1987)"},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM\u00a033(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects (extended abstract). In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 159\u2013170 (1993)","DOI":"10.1145\/164051.164071"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77096-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:07Z","timestamp":1619506807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77096-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770954","9783540770961"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77096-1_19","relation":{},"subject":[]}}