{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:42Z","timestamp":1725543822700},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_8","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"85-99","source":"Crossref","is-referenced-by-count":0,"title":["Election in the Qualitative World"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_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, STOC 1980, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/225298.225337","volume-title":"Proc. of the 8th annual conference on Computational Learning Theory, COLT 1995","author":"B. Awerbuch","year":"1995","unstructured":"Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot (extended abstract). In: Proc. of the 8th annual conference on Computational Learning Theory, COLT 1995, pp. 321\u2013328. ACM Press, New York (1995)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/777412.777469","volume-title":"Proc. of the 15th annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2003","author":"L. Barri\u00e8re","year":"2003","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can we elect if we cannot compare? In: Proc. of the 15th annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2003, pp. 324\u2013332. ACM Press, New York (2003)"},{"key":"8_CR4","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: Impact of sense of direction. In: Theory of Computing Systems (to appear)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M., Slonim, D.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: Proc. of the 35th annual Symposium on Foundations of Computer Science, FOCS 1994, pp. 75\u201385 (1994)","DOI":"10.1109\/SFCS.1994.365703"},{"key":"8_CR6","first-page":"16","volume-title":"Proc. 4th Israeli Symposium on Theory of Computing and Systems","author":"P. Boldi","year":"1996","unstructured":"Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16\u201326. IEEE Press, Los Alamitos (1996)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(00)00455-6","volume":"243","author":"P. Boldi","year":"2002","unstructured":"Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math.\u00a0243, 21\u201366 (2002)","journal-title":"Discrete Math."},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF00263584","volume":"25","author":"L. Boug\u00e9","year":"1988","unstructured":"Boug\u00e9, L.: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes. Acta Informatica\u00a025(2), 179\u2013201 (1988)","journal-title":"Acta Informatica"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11549345_19","volume-title":"Mathematical Foundations of Computer Science 2005","author":"J. Chalopin","year":"2005","unstructured":"Chalopin, J., M\u00e9tivier, Y.: A bridge between the asynchronous message passing model and local computations in graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 212\u2013223. Springer, Heidelberg (2005)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/11429647_10","volume-title":"Structural Information and Communication Complexity","author":"S. Das","year":"2005","unstructured":"Das, S., Flocchini, P., Nayak, A., Santoro, N.: Distributed exploration of an unknown graph. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 99\u2013114. Springer, Heidelberg (2005)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-39658-1_19","volume-title":"Algorithms - ESA 2003","author":"A. Dessmark","year":"2003","unstructured":"Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic rendezvous in graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 184\u2013195. Springer, Heidelberg (2003)"},{"issue":"5","key":"8_CR12","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C. Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous \u03c0-calculus. Mathematical Structures in Computer Science\u00a013(5), 685\u2013719 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"8_CR13","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 Transactions on parallel and distributed systems\u00a07(1), 69\u201389 (1996)","journal-title":"IEEE Transactions on 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\/11780823_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:18Z","timestamp":1619507838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11780823_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}