{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:22:26Z","timestamp":1743013346019,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_23","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"323-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Deterministic Leader Election in\u00a0Diameter-Two Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0414-7910","authenticated-orcid":false,"given":"Manish","family":"Kumar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1537-3462","authenticated-orcid":false,"given":"Anisur Rahaman","family":"Molla","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3605-6498","authenticated-orcid":false,"given":"Sumathi","family":"Sivasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0220023","volume":"20","author":"Y Afek","year":"1991","unstructured":"Afek, Y., Gafni, E.: Time and message bounds for election in synchronous and asynchronous complete networks. SIAM J. Comput. 20(2), 376\u2013394 (1991)","journal-title":"SIAM J. Comput."},{"key":"23_CR2","series-title":"Wiley series on parallel and distributed computing","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing - Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing - Fundamentals, Simulations, and Advanced Topics. Wiley series on parallel and distributed computing, 2nd edn. Wiley, Hoboken (2004)","edition":"2"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Augustine, J., Molla, A.R., Pandurangan, G.: Sublinear message bounds for randomized agreement. In: PODC, pp. 315\u2013324. ACM (2018)","DOI":"10.1145\/3212734.3212751"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00446-019-00354-2","volume":"33","author":"S Chatterjee","year":"2020","unstructured":"Chatterjee, S., Pandurangan, G., Robinson, P.: The complexity of leader election in diameter-two networks. Distributed Comput. 33(2), 189\u2013205 (2020). https:\/\/doi.org\/10.1007\/s00446-019-00354-2","journal-title":"Distributed Comput."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Robinson, P., Sourav, S.: Leader election in well-connected graphs. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, 23\u201327 July 2018","DOI":"10.1145\/3212734.3212754"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Humblet, P.: Selecting a leader in a clique in O(N log N) messages (1984)","DOI":"10.21236\/ADA146581"},{"key":"23_CR8","unstructured":"Kapron, B.M., Kempe, D., King, V., Saia, J., Sanwalani, V.: Fast asynchronous byzantine agreement and leader election with full information. In: SODA, pp. 1038\u20131047. SIAM (2008)"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00446-012-0157-9","volume":"25","author":"M Khan","year":"2012","unstructured":"Khan, M., Kuhn, F., Malkhi, D., Pandurangan, G., Talwar, K.: Efficient distributed approximation algorithms via probabilistic tree embeddings. Distrib. Comput. 25(3), 189\u2013205 (2012)","journal-title":"Distrib. Comput."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA, pp. 990\u2013999. ACM Press (2006)","DOI":"10.1145\/1109557.1109667"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/77606.77610","volume":"12","author":"E Korach","year":"1990","unstructured":"Korach, E., Kutten, S., Moran, S.: A modular technique for the design of efficient distributed leader finding algorithms. ACM Trans. Program. Lang. Syst. 12(1), 84\u2013101 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Korach, E., Moran, S., Zaks, S.: Tight lower and upper bounds for some distributed algorithms for a complete network of processors. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B.C., Canada, 27\u201329 August 1984, pp. 199\u2013207. ACM (1984)","DOI":"10.1145\/800222.806747"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/0216019","volume":"16","author":"E Korach","year":"1987","unstructured":"Korach, E., Moran, S., Zaks, S.: The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM J. Comput. 16(2), 231\u2013236 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(89)90103-5","volume":"64","author":"E Korach","year":"1989","unstructured":"Korach, E., Moran, S., Zaks, S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theor. Comput. Sci. 64(1), 125\u2013132 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Mosteiro, M.A.: Time and communication complexity of leader election in anonymous networks. In: ICDCS 2021, pp. 449\u2013460. IEEE (2021)","DOI":"10.1109\/ICDCS51616.2021.00050"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kumar, M., Molla, A.R.: Brief announcement: on the message complexity of fault-tolerant computation: leader election and agreement. In: PODC 2021, pp. 259\u2013262. ACM (2021)","DOI":"10.1145\/3465084.3467949"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: On the complexity of universal leader election. J. ACM 62(1), 7:1\u20137:27 (2015)","DOI":"10.1145\/2699440"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2014.02.009","volume":"561","author":"S Kutten","year":"2015","unstructured":"Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561, 134\u2013143 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Kutten, S., Robinson, P., Tan, M.M., Zhu, X.: Improved tradeoffs for leader election (2023). https:\/\/doi.org\/10.48550\/arXiv.2301.08235","DOI":"10.48550\/arXiv.2301.08235"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR21","unstructured":"Lann, G.L.: Distributed systems - towards a formal approach. In: Information Processing, Proceedings of the 7th IFIP Congress 1977, pp. 155\u2013160. North-Holland (1977)"},{"key":"23_CR22","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)"},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"1","key":"23_CR24","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0743-7315(90)90074-Y","volume":"8","author":"D Peleg","year":"1990","unstructured":"Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96\u201399 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach (2000)","DOI":"10.1137\/1.9780898719772"},{"issue":"2","key":"23_CR26","first-page":"105","volume":"7","author":"M Refai","year":"2010","unstructured":"Refai, M., Sharieh, A.A.A., Alshammari, F.: Leader election algorithm in 2D torus networks with the presence of one link failure. Int. Arab J. Inf. Technol. 7(2), 105\u2013114 (2010)","journal-title":"Int. Arab J. Inf. Technol."},{"key":"23_CR27","series-title":"Wiley series on parallel and distributed computing","volume-title":"Design and Analysis of Distributed Algorithms","author":"N Santoro","year":"2007","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley series on parallel and distributed computing, Wiley, Hoboken (2007)"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Singh, G.: Efficient distributed algorithms for leader election in complete networks. In: ICDCS, pp. 472\u2013479. IEEE Computer Society (1991)","DOI":"10.1109\/ICDCS.1991.148712"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Tel, G.: Introduction to Distributed Algorithms (1994)","DOI":"10.1007\/BFb0020419"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Yifrach, A., Mansour, Y.: Fair leader election for rational agents in asynchronous rings and networks. In: Newport, C., Keidar, I. (eds.) Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, 23\u201327 July 2018, pp. 217\u2013226. ACM (2018)","DOI":"10.1145\/3212734.3212767"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T03:33:18Z","timestamp":1729308798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}