{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:26Z","timestamp":1725701666655},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_42","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"479-490","source":"Crossref","is-referenced-by-count":5,"title":["Knowledge, Level of Symmetry, and Time of Leader Election"],"prefix":"10.1007","author":[{"given":"Emanuele G.","family":"Fusco","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM\u00a035, 845\u2013875 (1988)","journal-title":"Journal of the ACM"},{"key":"42_CR2","unstructured":"Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry Breaking in Anonymous Networks: Characterizations. In: Proc. 4th Israel Symposium on Theory of Computing and Systems (ISTCS 1996), pp. 16\u201326 (1996)"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symp. on Principles of Distributed Computing, pp. 181\u2013188 (1999)","DOI":"10.1145\/301308.301355"},{"key":"42_CR4","first-page":"254","volume":"64","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N.: Sorting and election in anonymous asynchronous rings. JPDC\u00a064, 254\u2013265 (2004)","journal-title":"JPDC"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G.N. Fredrickson","year":"1987","unstructured":"Fredrickson, G.N., Lynch, N.A.: Electing a leader in a synchronous ring. Journal of the ACM\u00a034, 98\u2013115 (1987)","journal-title":"Journal of the ACM"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00446-011-0131-y","volume":"24","author":"E. Fusco","year":"2011","unstructured":"Fusco, E., Pelc, A.: How much memory is needed for leader election. Distributed Computing\u00a024, 65\u201378 (2011)","journal-title":"Distributed Computing"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Haddar, M.A., Kacem, A.H., M\u00e9tivier, Y., Mosbah, M., Jmaiel, M.: Electing a leader in the local computation model using mobile agents. In: Proc. 6th ACS\/IEEE Int. Conference on Computer Systems and Applications (AICCSA 2008), pp. 473\u2013480 (2008)","DOI":"10.1109\/AICCSA.2008.4493575"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"D.S. Hirschberg","year":"1980","unstructured":"Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processes. Communications of the ACM\u00a023, 627\u2013628 (1980)","journal-title":"Communications of the ACM"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in\u00a0radio networks. In: Proc., 21st ACM Symp. on Principles of Distr. Comp. (PODC 2002 ), pp. 51\u201357 (2002)","DOI":"10.1145\/571825.571833"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-642-02930-1_43","volume-title":"Automata, Languages and Programming","author":"D. Kowalski","year":"2009","unstructured":"Kowalski, D., Pelc, A.: Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 521\u2013533. Springer, Heidelberg (2009)"},{"key":"42_CR11","unstructured":"Kranakis, E.: Symmetry and Computability in Anonymous Networks: A Brief Survey. In: Proc. 3rd Int. Conf. on Structural Information and Communication Complexity, pp. 1\u201316 (1997)"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean Functions on Anonymous Networks. Information and Computation\u00a0114, 214\u2013236 (1994)","journal-title":"Information and Computation"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TPDS.2002.1003864","volume":"13","author":"K. Nakano","year":"2002","unstructured":"Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Transactions on Parallel and Distributed Systems\u00a013, 516\u2013526 (2002)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"42_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(93)E0133-J","volume":"56","author":"N. Norris","year":"1995","unstructured":"Norris, N.: Universal Covers of Graphs: Isomorphism to Depth N\u2009\u2212\u20091 Implies Isomorphism to All Depths. Discrete Applied Mathematics\u00a056(1), 61\u201374 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing, A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"Peterson, G.L.: An O(n logn) unidirectional distributed algorithm for the circular extrema problem. ACM Transactions on Programming Languages and Systems\u00a04, 758\u2013762 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Sakamoto, N.: Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks. In: Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC ), pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301352"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"D.E. Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. on Computing\u00a015, 468\u2013477 (1986)","journal-title":"SIAM J. on Computing"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-51687-5_52","volume-title":"Distributed Algorithms","author":"M. Yamashita","year":"1989","unstructured":"Yamashita, M., Kameda, T.: Electing a Leader when Procesor Identity Numbers are not Distinct. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol.\u00a0392, pp. 303\u2013314. Springer, Heidelberg (1989)"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems\u00a07, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:57Z","timestamp":1620129297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}