{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T13:53:15Z","timestamp":1758981195376},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_8","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"90-104","source":"Crossref","is-referenced-by-count":15,"title":["Election and Local Computations on Edges"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[]},{"given":"Yves","family":"M\u00e9tivier","sequence":"additional","affiliation":[]}],"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, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"8_CR2","volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. McGraw-Hill, New York (1998)"},{"key":"8_CR3","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_CR4","first-page":"181","volume-title":"Proceedings of the 18th ACM Symposium on principles of distributed computing","author":"P. Boldi","year":"1999","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on principles of distributed computing, pp. 181\u2013188. ACM Press, New York (1999)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45414-4_3","volume-title":"Distributed Computing","author":"P. Boldi","year":"2001","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 33\u201347. Springer, Heidelberg (2001)"},{"key":"8_CR6","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."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45931-6_12","volume-title":"Foundations of Software Science and Computation Structures","author":"E. Godard","year":"2002","unstructured":"Godard, E., M\u00e9tivier, Y.: A characterization of families of graphs in which election is possible (ext.abstrat). In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"8_CR8","unstructured":"Godard, E., M\u00e9tivier, Y., Muscholl, A.: Characterization of Classes of Graphs Recognizable by Local Computations. Theory of Computing Systems (to appear)"},{"key":"8_CR9","unstructured":"Godard, E., M\u00e9tivier, Y., Tel, G.: Election, termination and graph cartography (in preparation)"},{"key":"8_CR10","first-page":"155","volume-title":"Information processing 1977","author":"G. LeLann","year":"1977","unstructured":"LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.) Information processing 1977, pp. 155\u2013160. North-Holland, Amsterdam (1977)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Lamport, L., Lynch, N.: Distributed computing: models and methods. Handbook of theoretical computer science, B:1157\u20131199 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50023-8"},{"key":"8_CR12","volume-title":"Distributed algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed algorithms. Morgan Kaufman, San Francisco (1996)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Massey, W.S.: A basic course in algebraic topology. Springer, Heidelberg (1991), Graduate texts in mathematics","DOI":"10.1007\/978-1-4939-9063-4"},{"key":"8_CR14","series-title":"Lecture notes in computer science","first-page":"279","volume-title":"Petri nets, applications and relationship to other models of concurrency","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., et al. (eds.) Petri nets, applications and relationship to other models of concurrency. Lecture notes in computer science, vol.\u00a0255, pp. 279\u2013324. Springer, Heidelberg (1987)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0020-0190(97)00022-7","volume":"61","author":"A. Mazurkiewicz","year":"1997","unstructured":"Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters\u00a061, 233\u2013239 (1997)","journal-title":"Inf. Processing Letters"},{"key":"8_CR16","unstructured":"M\u00e9tivier, Y., Tel, G.: Termination detection and universal graph reconstruction. In: SIROCCO 2000 - 7th International Colloquium on Structural Information & Communication Complexity, pp. 237\u2013251 (2000)"},{"key":"8_CR17","unstructured":"Reidemeister, K.: Einf\u00fchrung in die Kombinatorische Topologie. Vieweg, Brunswick (1932)"},{"volume-title":"Handbook of discrete and combinatorial mathematics","year":"2000","key":"8_CR18","unstructured":"Rosen, K.H. (ed.): Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton (2000)"},{"key":"8_CR19","doi-asserted-by":"crossref","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":"8_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01192691","volume":"29","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing functions on asynchronous anonymous networks. Math. Systems Theory\u00a029, 331\u2013356 (1996)","journal-title":"Math. Systems Theory"},{"issue":"1","key":"8_CR21","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"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/71.481600","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part ii - decision and membership problems. IEEE Transactions on parallel and distributed systems\u00a07(1), 90\u201396 (1996)","journal-title":"IEEE Transactions on parallel and distributed systems"},{"issue":"9","key":"8_CR23","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1109\/71.798313","volume":"10","author":"M. Yamashita","year":"1999","unstructured":"Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on parallel and distributed systems\u00a010(9), 878\u2013887 (1999)","journal-title":"IEEE Transactions on parallel and distributed systems"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T21:46:35Z","timestamp":1591739195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}