{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:04Z","timestamp":1750220044281,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T00:00:00Z","timestamp":1672790400000},"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":[[2023,1,4]]},"DOI":"10.1145\/3571306.3571424","type":"proceedings-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T16:17:12Z","timestamp":1672762632000},"page":"294-295","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0414-7910","authenticated-orcid":false,"given":"Manish","family":"Kumar","sequence":"first","affiliation":[{"name":"Indian Statistical Institute Kolkata, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1537-3462","authenticated-orcid":false,"given":"Anisur Rahaman","family":"Molla","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute Kolkata, India"}]}],"member":"320","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Seth Gilbert and Dariusz\u00a0R. Kowalski. 2010. Distributed Agreement with Optimal Communication Complexity. In SODA. 965\u2013977.  Seth Gilbert and Dariusz\u00a0R. Kowalski. 2010. Distributed Agreement with Optimal Communication Complexity. In SODA. 965\u2013977.","DOI":"10.1137\/1.9781611973075.78"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467949"},{"key":"e_1_3_2_1_3_1","unstructured":"Manish Kumar and Anisur\u00a0Rahaman Molla. 2021. On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. https:\/\/drive.google.com\/file\/d\/1hX8PCnez-mnefIOLoghUD6hTeJUkXLoB\/view  Manish Kumar and Anisur\u00a0Rahaman Molla. 2021. On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. https:\/\/drive.google.com\/file\/d\/1hX8PCnez-mnefIOLoghUD6hTeJUkXLoB\/view"}],"event":{"name":"ICDCN 2023: 24th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2023","location":"Kharagpur India"},"container-title":["Proceedings of the 24th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571424","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571306.3571424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:53Z","timestamp":1750183673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,4]]},"references-count":3,"alternative-id":["10.1145\/3571306.3571424","10.1145\/3571306"],"URL":"https:\/\/doi.org\/10.1145\/3571306.3571424","relation":{},"subject":[],"published":{"date-parts":[[2023,1,4]]},"assertion":[{"value":"2023-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}