{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:11:35Z","timestamp":1743027095901,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534250"},{"type":"electronic","value":"9783662534267"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53426-7_2","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T04:49:15Z","timestamp":1472878155000},"page":"16-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Deterministic Leader Election in $$O(D+\\log n)$$ Time with Messages of Size O(1)"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Casteigts","sequence":"first","affiliation":[]},{"given":"Yves","family":"M\u00e9tivier","sequence":"additional","affiliation":[]},{"given":"John Michael","family":"Robson","sequence":"additional","affiliation":[]},{"given":"Akka","family":"Zemmari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"2_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley, Hoboken (2004)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In: Proceedings of 19th Symposium on Theory of Computing, New York, USA, pp. 230\u2013240 (1987)","DOI":"10.1145\/28395.28421"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01783661","volume":"4","author":"A Bar-Noy","year":"1990","unstructured":"Bar-Noy, A., Naor, J., Naor, M.: One-bit algorithms. Distrib. Comput. 4, 3\u20138 (1990)","journal-title":"Distrib. Comput."},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1994.1002","volume":"114","author":"HL Bodlaender","year":"1994","unstructured":"Bodlaender, H.L., Moran, S., Warmuth, M.K.: The distributed bit complexity of the ring: from the anonymous case to the non-anonymous case. Inf. Comput. 114(2), 34\u201350 (1994)","journal-title":"Inf. Comput."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(90)90187-3","volume":"36","author":"HL Bodlaender","year":"1990","unstructured":"Bodlaender, H.L., Tel, G.: Bit-optimal election in synchronous rings. Inf. Process. Lett. 36(1), 53\u201356 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1145\/1326554.1326557","volume":"55","author":"Y Dinitz","year":"2008","unstructured":"Dinitz, Y., Moran, S., Rajsbaum, S.: Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1), 167\u2013183 (2008)","journal-title":"J. ACM"},{"issue":"2\u20133","key":"2_CR8","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.tcs.2007.04.027","volume":"384","author":"Y Dinitz","year":"2007","unstructured":"Dinitz, Y., Solomon, N.: Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. 384(2\u20133), 168\u2013183 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-014-0237-0","volume":"28","author":"EG Fusco","year":"2015","unstructured":"Fusco, E.G., Pelc, A.: Knowledge, level of symmetry, and time of leader election. Distrib. Comput. 28(4), 221\u2013232 (2015)","journal-title":"Distrib. Comput."},{"key":"2_CR10","unstructured":"Gallager, R.G.: Finding a leader in a network with \n                    \n                      \n                    \n                    $$o(e\\, {+}\\, n\\log n)$$\n                   messages. Technical Report Internal Memo., M.I.T., Cambridge, MA (1979)"},{"key":"2_CR11","unstructured":"Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in \n                    \n                      \n                    \n                    $${O}(\\sqrt{\\log n})$$\n                   bit rounds. In: 20th International Parallel and Distributed Processing Symposium (IPDPS), Rhodes Island, Greece. IEEE (2006)"},{"key":"2_CR12","volume-title":"Communication complexity","author":"E Kushilevitz","year":"1999","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, New York (1999)"},{"key":"2_CR13","first-page":"7: 1","volume":"7","author":"S Kutten","year":"2015","unstructured":"Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: On the complexity of universal leader election. J. ACM 7, 7: 1\u20137: 27 (2015)","journal-title":"J. ACM"},{"key":"2_CR14","unstructured":"LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.), Information processing 1977, pp. 155\u2013160. North-Holland (1977)"},{"key":"2_CR15","volume-title":"Distributed algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed algorithms. Morgan Kaufman, San Francisco (1996)"},{"issue":"1","key":"2_CR16","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."},{"volume-title":"Handbook of Discrete and Combinatorial Mathematics","year":"2000","key":"2_CR17","unstructured":"Rosen, K.H. (ed.): Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)"},{"issue":"3","key":"2_CR18","first-page":"131","volume":"13","author":"N Santoro","year":"1984","unstructured":"Santoro, N.: On the message complexity of distributed problems. Int. J. Parallel Program. 13(3), 131\u2013147 (1984)","journal-title":"Int. J. Parallel Program."},{"key":"2_CR19","volume-title":"Design and analysis of distributed algorithm","author":"N Santoro","year":"2007","unstructured":"Santoro, N.: Design and analysis of distributed algorithm. Wiley, New York (2007)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-24100-0_4","volume-title":"Distributed Computing","author":"J Schneider","year":"2011","unstructured":"Schneider, J., Wattenhofer, R.: Trading bit, message, and time complexity of distributed algorithms. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 51\u201365. Springer, Heidelberg (2011)"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"29","author":"A Segall","year":"1983","unstructured":"Segall, A.: Distributed network protocols. IEEE Trans. Inf. Theor. 29(1), 23\u201324 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"2_CR22","volume-title":"Distributed Systems - Principles and Paradigms","author":"A Tanenbaum","year":"2002","unstructured":"Tanenbaum, A., van Steen, M.: Distributed Systems - Principles and Paradigms. Prentice Hall, Upper Saddle River (2002)"},{"key":"2_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to distributed algorithms","author":"G Tel","year":"2000","unstructured":"Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributed computing. In: Proceedings of 11th Symposium on Theory of Computing (STOC), pp. 209\u2013213. ACM Press (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53426-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:11:24Z","timestamp":1558314684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53426-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534250","9783662534267"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53426-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Distributed Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wdag2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}