{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:02Z","timestamp":1736084402170,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022443","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"143-150","source":"Crossref","is-referenced-by-count":13,"title":["Randomized consensus in expected O(n2log n) operations"],"prefix":"10.1007","author":[{"given":"Gabi","family":"Bracha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ophir","family":"Rachman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson, On achieving consensus using a shared memory, Proc. of the 7th ACM Symp. on Principles of Distributed Computing, August 1988, pp. 291\u2013302.","DOI":"10.1145\/62546.62594"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"J. Aspnes, Time and space-efficient randomized consensus, Proc. of the 9th ACM Symp. on Principles of Distributed Computing, August 1990, pp. 325\u2013331.","DOI":"10.1145\/93385.93433"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"J. Aspnes and M. Herlihy, Fast randomized consensus using shared memory, Journal of algorithms, September 1990, pp. 441\u2013461.","DOI":"10.1016\/0196-6774(90)90021-6"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"H. Attiya, D. Dolev, and N. Shavit, Bounded polynomial randomized consensus, Proc. of the 8th ACM Symp. on Principles of Distributed Computing, August 1989, pp. 281\u2013294.","DOI":"10.21236\/ADA213808"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"H. Attiya, N. Lynch, and N. Shavit, Are Wait-Free Algorithms Fast? Proc. of the 31st IEEE Symp. on Foundations of Computer Science, 1990.","DOI":"10.1109\/FSCS.1990.89524"},{"key":"10_CR6","volume-title":"Technical Report #662","author":"G. Bracha","year":"1990","unstructured":"G. Bracha and O. Rachman. Approximated Counters and Randomized Consensus. In Technical Report #662, Computer Science Department, Technion, Haifa, Israel. December 1990."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Israeli, and M. Li, On processor coordination using asynchronous hardware, Proc. of the 6th ACM Symp. on Principles of Distributed Computing, August 1987, pp. 86\u201397.","DOI":"10.1145\/41840.41848"},{"issue":"No1","key":"10_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, and L. Stockmeyer, On the minimal synchrony needed for distributed consensus, Journal of the ACM, Vol. 34, No 1, January 1987, pp. 77\u201397.","journal-title":"Journal of the ACM"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"M. Herlihy, Wait Free Implementations of Concurrent Objects, Proc. of the 7th ACM Symp. on Principles of Distributed Computing, 1988, pp. 276\u2013290.","DOI":"10.1145\/62546.62593"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1,2","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, On interprocess communication, Distributed Computing 1,2, 1986, pp. 77\u2013101.","journal-title":"Distributed Computing"},{"key":"10_CR11","unstructured":"M. Loui and H. Abu-Amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, Vol. 4, JAI Press, Inc., 1987, 163\u2013183."},{"key":"10_CR12","unstructured":"M. Saks, N. Shavit and H. Woll, Optimal time randomized consensus-making resilient algorithms fast in practice, Proc. 2nd ACM Symp. on Discrete Algorithms, January 1991, pp. 351\u2013362."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022443.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T12:59:48Z","timestamp":1736081988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0022443","relation":{},"subject":[]}}