{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:59Z","timestamp":1742914199720,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_321","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:29:45Z","timestamp":1214504985000},"page":"723-725","source":"Crossref","is-referenced-by-count":0,"title":["Randomization in Distributed Computing"],"prefix":"10.1007","author":[{"given":"Tushar Deepak","family":"Chandra","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2\u20133","key":"321_CR1_321","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-002-0081-5","volume":"16","author":"J. Aspnes","year":"2003","unstructured":"Aspnes, J.: Randomized protocols for asynchronous consensus. Distrib. Comput. 16(2\u20133), 165\u2013175 (2003)","journal-title":"Distrib. Comput."},{"key":"321_CR2_321","first-page":"137","volume-title":"Proceedings of the 33rd Symposium on Foundations of Computer Science. 24\u201326 October 1992","author":"J. Aspnes","year":"1992","unstructured":"Aspnes, J., Waarts, O.: Randomized consensus in expected $$ { o(n \\log^2 n) } $$ operations per processor. In: Proceedings of the 33rd Symposium on Foundations of Computer Science. 24\u201326 October 1992, pp.\u00a0137\u2013146. IEEE Computer Society, Pittsburgh (1992)"},{"key":"321_CR3_321","doi-asserted-by":"crossref","unstructured":"Attiya, H., Censor, K.: Tight bounds for asynchronous randomized consensus. In: Proceedings of the Symposium on the Theory of Computation. San Diego, 11\u201313 June 2007 ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) (2007)","DOI":"10.1145\/1250790.1250814"},{"key":"321_CR4_321","doi-asserted-by":"crossref","unstructured":"Aumann, Y.: Efficient asynchronous consensus with the weak adversary scheduler. In: Symposium on Principles of Distrib. Comput.(PODC) Santa Barbara, 21\u201324 August 1997, pp.\u00a0209\u2013218. ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) (1997)","DOI":"10.1145\/259380.259441"},{"key":"321_CR5_321","unstructured":"Aumann, Y., Kapach-Levy, A.: Cooperative sharing and asynchronous consensus using single-reader\/single-writer registers. In: Proceedings of 10th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA) Baltimore, 17\u201319 January 1999, pp.\u00a061\u201370. Society for Industrial and Applied Mathematics (SIAM) (1999)"},{"issue":"1","key":"321_CR6_321","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. J.\u00a0ACM (JACM) 34(1), 77\u201397 (1987)","journal-title":"J. ACM (JACM)"},{"key":"321_CR7_321","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. In: Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database System (PODS) Atlante, 21\u201323 March, pp.\u00a01\u20137. Association for Computational Machinery (ACM) (1983)","DOI":"10.1145\/588058.588060"},{"issue":"1","key":"321_CR8_321","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 Trans. Programm. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"321_CR9_321","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Mateo (1996)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:31:18Z","timestamp":1662175878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_321"}},"subtitle":["1996; Chandra"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_321","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}