{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:09:16Z","timestamp":1748923756066,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,7,25]],"date-time":"2004-07-25T00:00:00Z","timestamp":1090713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,7,25]]},"DOI":"10.1145\/1011767.1011819","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"347-356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Group membership"],"prefix":"10.1145","author":[{"given":"Roger I.","family":"Khazan","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2004,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"April","author":"CM.","year":"1996","unstructured":"A CM. Communications of the ACM 39(4) , special issue on Group Communications Systems , April 1996 . ACM. Communications of the ACM 39(4), special issue on Group Communications Systems, April 1996."},{"key":"e_1_3_2_1_3_1","volume-title":"22nd IEEE Fault-Tolerant Computing Symposium (FTCS)","author":"Amir Y.","year":"1992","unstructured":"Y. Amir , D. Dolev , S. Kramer , and D. Malki . Transis: A communication sub-system for high availability . In 22nd IEEE Fault-Tolerant Computing Symposium (FTCS) , July 1992 . Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication sub-system for high availability. In 22nd IEEE Fault-Tolerant Computing Symposium (FTCS), July 1992."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/210223.210224"},{"key":"e_1_3_2_1_5_1","volume-title":"Manning","author":"Birman K.","year":"1996","unstructured":"K. Birman . Building Secure and Reliable Network Applications . Manning , 1996 . K. Birman. Building Secure and Reliable Network Applications. Manning, 1996."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/41457.37515"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248120"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/503112.503113"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/377769.377776"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248062"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00333-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/566340.566341"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645955.675801"},{"key":"e_1_3_2_1_15_1","volume-title":"Distributed Algorithms","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed Algorithms . Morgan Kaufmann Publishers , 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/227210.227229"}],"event":{"name":"PODC04: Principles of Distributed Computing 2004","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"St. John's Newfoundland Canada","acronym":"PODC04"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1011767.1011819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T20:13:41Z","timestamp":1748895221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011819"}},"subtitle":["a novel approach and the first single-round algorithm"],"short-title":[],"issued":{"date-parts":[[2004,7,25]]},"references-count":15,"alternative-id":["10.1145\/1011767.1011819","10.1145\/1011767"],"URL":"https:\/\/doi.org\/10.1145\/1011767.1011819","relation":{},"subject":[],"published":{"date-parts":[[2004,7,25]]},"assertion":[{"value":"2004-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}