{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:31:12Z","timestamp":1725557472926},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642132834"},{"type":"electronic","value":"9783642132841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13284-1_12","type":"book-chapter","created":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T03:43:53Z","timestamp":1275709433000},"page":"142-156","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Tree Comparison with Nodes of Limited Memory"],"prefix":"10.1007","author":[{"given":"Emanuele Guido","family":"Fusco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_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":"12_CR2","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0196-6774(91)90002-G","volume":"12","author":"H. Attiya","year":"1991","unstructured":"Attiya, H., Snir, M.: Better Computing on the Anonymous Ring. Journal of Algorithms\u00a012, 204\u2013238 (1991)","journal-title":"Journal of Algorithms"},{"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)","key":"12_CR3","DOI":"10.1145\/301308.301355"},{"unstructured":"Burns, J.E.: A formal model for message passing systems, Tech. Report TR-91, Computer Science Department, Indiana University, Bloomington (September 1980)","key":"12_CR4"},{"unstructured":"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":"12_CR5"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(94)00178-L","volume":"145","author":"K. Diks","year":"1995","unstructured":"Diks, K., Kranakis, E., Malinowski, A., Pelc, A.: Anonymous wireless rings. Theoretical Computer Science\u00a0145, 95\u2013109 (1995)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","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":"12_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"},{"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)","key":"12_CR9","DOI":"10.1145\/571831.571833"},{"key":"12_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. LNCS, vol.\u00a05556, pp. 521\u2013533. Springer, Heidelberg (2009)"},{"unstructured":"Kranakis, E.: Symmetry and Computability in Anonymous Networks: A Brief Survey. In: Proc. 3rd Int. Conf. on Structural Inform. and Comm. Complexity, pp. 1\u201316 (1997)","key":"12_CR11"},{"key":"12_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"},{"doi-asserted-by":"crossref","unstructured":"Lindell, S.: A logspace algorithm for tree canonization. In: Proc. 24th ACM Symposium on Theory of Computing (STOC 1992), pp. 400\u2013404 (1992)","key":"12_CR13","DOI":"10.1145\/129712.129750"},{"key":"12_CR14","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 Trans. on Parallel Distributed Systems\u00a013, 516\u2013526 (2002)","journal-title":"IEEE Trans. on Parallel Distributed Systems"},{"key":"12_CR15","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 Trans. on Prog. Languages and Syst.\u00a04, 758\u2013762 (1982)","journal-title":"ACM Trans. on Prog. Languages and Syst."},{"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 1999), pp. 173\u2013179 (1999)","key":"12_CR16","DOI":"10.1145\/301308.301352"},{"key":"12_CR17","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"},{"doi-asserted-by":"crossref","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks. In: Proc. 7th ACM Symp. on Principles of Distributed Computing (PODC 1988), pp. 117\u2013130 (1988)","key":"12_CR18","DOI":"10.1145\/62546.62568"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1989)"},{"key":"12_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","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13284-1_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:03:56Z","timestamp":1606169036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13284-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642132834","9783642132841"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13284-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}