{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:06Z","timestamp":1725455706150},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020427","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:21:02Z","timestamp":1131862862000},"page":"101-115","source":"Crossref","is-referenced-by-count":3,"title":["Exotic behaviour of consensus numbers"],"prefix":"10.1007","author":[{"given":"Robert","family":"Cori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"E. Borowsky, E. Gafni, and Y. Afek. Consensus power makes (some) sense! In Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994.","DOI":"10.1145\/197917.198126"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"H. Brit and S. Moran. Wait-freedom vs. bounded wait-freedom in public data structures. In Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994. in preparation.","DOI":"10.1145\/197917.197950"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O. Biran","year":"1990","unstructured":"O. Biran, S. Moran, and S. Zaks. A combinatorial characterization of the distributed 1-solvable tasks. Journal of Algorithm 11, pages 420\u2013440, 1990. A preliminary versions apperaed in Proc. 7th ACM Symp. on Principles of Distributed Computing, August 1988.","journal-title":"Journal of Algorithm"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 86\u201397, 1987.","DOI":"10.1145\/41840.41848"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374\u2013382, April 1985.","journal-title":"Journal of the ACM"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy. Wait-free synchronization. ACM Trans. on Programming Languages and Systems, 11(1):124\u2013149, January 1991.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"P. Jayanti. On the robustness of herlihy hierarchy. In Proc. 12th ACM Symp. on Principles of Distributed Computing, August 1993.","DOI":"10.1145\/164051.164070"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"J. Kleinberg and S. Mullainthan. Resource bounds and combinations of consensus objects. In Proc. 12th ACM Symp. on Principles of Distributed Computing, August 1993.","DOI":"10.1145\/164051.164069"},{"key":"8_CR9","first-page":"163","volume":"4","author":"C. M. Loui","year":"1987","unstructured":"C. M. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163\u2013183, 1987.","journal-title":"Advances in Computing Research"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"R. Lubitch and S. Moran. Closed schedulers: Constructions and applications to consensus protocols. In Proceedings of 6-th International Workshop on Distributed Algorithms, pages 11\u201334, November 1992. Revised Version in TR #796, Dept. of Computer Science, Technion, January 1994.","DOI":"10.1007\/3-540-56188-9_2"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"G. Peterson, R. Bazzi, and G. Neiger. A gap thorem for consensus types. In Proc. 13th ACM Symp. on Principles of Distributed Computing, August 1994.","DOI":"10.1145\/197917.198123"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science, vol. 405","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-52048-1_37","volume-title":"Information and Computation, 1994. Preliminary version appeared in 9th FCT-TCS Conference","author":"G. Taubenfeld","year":"1989","unstructured":"G. Taubenfeld, S. Katz, and S. Moran. Impossibility results in the presence of multiple faulty processes. Information and Computation, 1994. Preliminary version appeared in 9th FCT-TCS Conference, Bangalore, India, December, 1989, Lecture Notes in Computer Science, vol. 405 (eds.:C.E. Veni Madhavan), Springer Verlag 1989, pages 109\u2013120."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:46:02Z","timestamp":1586551562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0020427","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}