{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:48:57Z","timestamp":1770065337761,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031814037","type":"print"},{"value":"9783031814044","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81404-4_9","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:38:20Z","timestamp":1735605500000},"page":"108-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster Leader Election and\u00a0Its Applications for\u00a0Mobile Agents with\u00a0Parameter Advice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-7306","authenticated-orcid":false,"given":"Ajay D.","family":"Kshemkalyani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0414-7910","authenticated-orcid":false,"given":"Manish","family":"Kumar","sequence":"additional","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-0002-4930-4609","authenticated-orcid":false,"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,31]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Augustine, J., Moses Jr, W.K.: Dispersion of mobile robots: a study of memory-time trade-offs. In: ICDCN, pp. 1:1\u20131:10 (2018)","DOI":"10.1145\/3154273.3154293"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In: Aho, A.V. (ed.) STOC, pp. 230\u2013240. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28421","DOI":"10.1145\/28395.28421"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: FOCS, vol.\u00a030, pp. 364\u2013369. Citeseer (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Chand, P.K., Das, A., Molla, A.R.: Agent-based triangle counting and its applications in anonymous graphs. CoRR abs\/2402.03653 (2024). https:\/\/doi.org\/10.48550\/arxiv.2402.03653","DOI":"10.48550\/arxiv.2402.03653"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chand, P.K., Molla, A.R., Sivasubramaniam, S.: Run for cover: dominating set via mobile agents. In: ALGOWIN, pp. 133\u2013150. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-48882-5_10"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Cong, Y., Changjun, G., Zhang, T., Gao, Y.: Underwater robot sensing technology: a survey. Fundam. Res. 1 (2021). https:\/\/doi.org\/10.1016\/j.fmre.2021.03.002","DOI":"10.1016\/j.fmre.2021.03.002"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Deurer, J., Kuhn, F., Maus, Y.: Deterministic distributed dominating set approximation in the congest model. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 94\u2013103 (2019)","DOI":"10.1145\/3293611.3331626"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"El-Sayed, A., Scarborough, P., Seemann, L., Galea, S.: Social network analysis and agent-based modeling in social epidemiology. Epidemiol. perspect. Innov. EP+I 9, 1 (2012). https:\/\/doi.org\/10.1186\/1742-5573-9-1","DOI":"10.1186\/1742-5573-9-1"},{"key":"9_CR9","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/357195.357200","DOI":"10.1145\/357195.357200"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees (extended abstract). In: FOCS, pp. 659\u2013668. IEEE Computer Society (1993). https:\/\/doi.org\/10.1109\/SFCS.1993.366821","DOI":"10.1109\/SFCS.1993.366821"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Kshemkalyani, A.D., Kumar, M., Molla, A.R., Sharma, G.: Brief announcement: agent-based leader election, MST, and beyond. In: DISC 2024. LIPIcs, vol.\u00a0319, pp. 50:1\u201350:7 (2024). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2024.50","DOI":"10.4230\/LIPICS.DISC.2024.50"},{"key":"9_CR12","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":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of small k-dominating sets and applications. J. Algorithms 28(1), 40\u201366 (1998)","DOI":"10.1006\/jagm.1998.0929"},{"key":"9_CR14","unstructured":"Lann, G.L.: Distributed systems - towards a formal approach. In: Gilchrist, B. (ed.) Information Processing, Proceedings of the 7th IFIP Congress 1977, Toronto, Canada, 8\u201312 August 1977, pp. 155\u2013160. North-Holland (1977)"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Lee, J., Shin, S., Park, M., Kim, C.: Agent-based simulation and its application to analyze combat effectiveness in network-centric warfare considering communication failure environments. Math. Probl. Eng. 2018, 1\u20139 (2018). https:\/\/doi.org\/10.1155\/2018\/2730671","DOI":"10.1155\/2018\/2730671"},{"key":"9_CR16","unstructured":"Martinkus, K., Papp, P.A., Schesch, B., Wattenhofer, R.: Agent-based graph neural networks. In: The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, 1\u20135 May 2023. OpenReview.net (2023). https:\/\/openreview.net\/pdf?id=8WTAh0tj2jC"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Molla, A.R., Mondal, K., Moses Jr, W.K.: Fast deterministic gathering with detection on arbitrary graphs: the power of many robots. In: IEEE International Parallel and Distributed Processing Symposium, IPDPS, pp. 47\u201357. IEEE (2023)","DOI":"10.1109\/IPDPS54959.2023.00015"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/jagm.1996.0017","volume":"20","author":"A Panconesi","year":"1996","unstructured":"Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 356\u2013374 (1996)","journal-title":"J. Algorithms"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Pattanayak, D., Bhagat, S., Chaudhuri, S.G., Molla, A.R.: Maximal independet set via mobile agents. In: ICDCN, pp. 74\u201383. ACM (2024)","DOI":"10.1145\/3631461.3631543"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96\u201399 (1990). https:\/\/doi.org\/10.1016\/0743-7315(90)90074-Y","DOI":"10.1016\/0743-7315(90)90074-Y"},{"issue":"5","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1137\/S0097539700369740","volume":"30","author":"D Peleg","year":"2000","unstructured":"Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput. 30(5), 1427\u20131442 (2000). https:\/\/doi.org\/10.1137\/S0097539700369740","journal-title":"SIAM J. Comput."},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Sudo, Y., Baba, D., Nakamura, J., Ooshita, F., Kakugawa, H., Masuzawa, T.: A single agent exploration in unknown undirected graphs with whiteboards. In: Proceedings of the 3rd International ACM Workshop on Reliability, Availability, and Security, WRAS 2010, vol. E98.A (2010). https:\/\/doi.org\/10.1145\/1953563.1953570","DOI":"10.1145\/1953563.1953570"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Sudo, Y., Shibata, M., Nakamura, J., Kim, Y., Masuzawa, T.: Near-linear time dispersion of mobile agents. In: Alistarh, D. (ed.) 38th International Symposium on Distributed Computing, DISC 2024, October 28 to November 1, 2024, Madrid, Spain. LIPIcs, vol.\u00a0319, pp. 38:1\u201338:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.DISC.2024.38","DOI":"10.4230\/LIPICS.DISC.2024.38"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12:1\u201312:15 (2014). https:\/\/doi.org\/10.1145\/2601068","DOI":"10.1145\/2601068"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Zhuge, C., Shao, C., Wei, B.: An agent-based spatial urban social network generator: a case study of Beijing, China. J. Comput. Sci. 29 (2018). https:\/\/doi.org\/10.1016\/j.jocs.2018.09.005","DOI":"10.1016\/j.jocs.2018.09.005"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81404-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T01:03:50Z","timestamp":1735607030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81404-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,31]]},"ISBN":["9783031814037","9783031814044"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81404-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,31]]},"assertion":[{"value":"31 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}