{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:27:25Z","timestamp":1725474445611},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499909"},{"type":"electronic","value":"9783540499916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11945529_14","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T12:18:52Z","timestamp":1164629932000},"page":"187-201","source":"Crossref","is-referenced-by-count":21,"title":["Mobile Agent Algorithms Versus Message Passing Algorithms"],"prefix":"10.1007","author":[{"given":"J.","family":"Chalopin","sequence":"first","affiliation":[]},{"given":"E.","family":"Godard","sequence":"additional","affiliation":[]},{"given":"Y.","family":"M\u00e9tivier","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ossamy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","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":"14_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/225298.225337","volume-title":"Proc. of the eighth 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 eighth annual conference on Computational Learning Theory, COLT 1995, pp. 321\u2013328. ACM Press, New York (1995)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/777412.777469","volume-title":"Proc. of the fifteenth 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 fifteenth annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2003, pp. 324\u2013332. ACM Press, New York (2003)"},{"key":"14_CR4","unstructured":"Barri\u00e9re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and rendezvous in fully anonymous systems with sense of direction. In: Proc. of the 10th International Colloquium on Structural Information Complexity, SIROCCO 2003, vol.\u00a017, pp. 17\u201332. Carleton Scientific (2003)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Barri\u00e9re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory of Computing Systems (to appear)","DOI":"10.1007\/s00224-005-1223-5"},{"key":"14_CR6","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":"14_CR7","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":"14_CR8","volume-title":"Mobile agents: basic concepts, mobility models and the tracy toolkit","author":"P. Braun","year":"2005","unstructured":"Braun, P., Rossak, W.: Mobile agents: basic concepts, mobility models and the tracy toolkit. Morgan Kaufman, San Francisco (2005)"},{"key":"14_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 (extended abstract). In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 212\u2013223. Springer, Heidelberg (2005)"},{"key":"14_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)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X. Deng","year":"1998","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment. i: the rectilinear case. J. ACM\u00a045(2), 215\u2013245 (1998)","journal-title":"J. ACM"},{"key":"14_CR12","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)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(02)00592-3","volume":"301","author":"P. Flocchini","year":"2003","unstructured":"Flocchini, P., Roncato, A., Santoro, N.: Computing on anonymous networks with sense of direction. Theoretical Computer Science\u00a0301, 355\u2013379 (2003)","journal-title":"Theoretical Computer Science"},{"key":"14_CR14","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":"14_CR15","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 Math.\u00a056, 61\u201374 (1995)","journal-title":"Discrete Applied Math."},{"key":"14_CR16","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)"},{"issue":"1","key":"14_CR17","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","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11945529_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:18:12Z","timestamp":1619507892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11945529_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499909","9783540499916"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11945529_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}