{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:13Z","timestamp":1725619093119},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24550-3_9","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T06:56:37Z","timestamp":1318056997000},"page":"92-107","source":"Crossref","is-referenced-by-count":7,"title":["Robot Networks with Homonyms: The Case of Patterns Formation"],"prefix":"10.1007","author":[{"given":"Zohir","family":"Bouzid","sequence":"first","affiliation":[]},{"given":"Anissa","family":"Lamani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"14","key":"9_CR1","first-page":"1070","volume":"11","author":"N. Agmon","year":"2004","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SODA\u00a011(14), 1070\u20131078 (2004)","journal-title":"SODA"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11560586_4","volume-title":"Theoretical Computer Science","author":"L. Anderegg","year":"2005","unstructured":"Anderegg, L., Cieliebak, M., Prencipe, G.: Efficient algorithms for detecting regular point configurations. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol.\u00a03701, pp. 23\u201335. Springer, Heidelberg (2005)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Lamani, A.: Robot networks with homonyms: The case of patterns formation. hal.inria.fr (2011)","DOI":"10.1007\/978-3-642-24550-3_9"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01585739","volume":"46","author":"R. Chandrasekaran","year":"1990","unstructured":"Chandrasekaran, R., Tamir, A.: Algebraic optimization: the fermat-weber location problem. Mathematical Programming\u00a046(1), 219\u2013224 (1990)","journal-title":"Mathematical Programming"},{"key":"9_CR5","first-page":"267","volume-title":"PODC","author":"S. Das","year":"2010","unstructured":"Das, S., Flocchini, P., Santoro, N., Yamashita, M.: On the computational power of oblivious robots: forming a series of geometric patterns. In: PODC, pp. 267\u2013276. ACM, New York (2010)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., Tran-The, H.: Byzantine agreement with homonyms. In: PODC (2011)","DOI":"10.1145\/1993806.1993810"},{"issue":"14-15","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1016\/j.tcs.2010.01.007","volume":"411","author":"P. Flocchini","year":"2010","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Remembering without memory: Tree exploration by asynchronous oblivious robots. Theoretical Computer Science\u00a0411(14-15), 1583\u20131598 (2010)","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/11429647_16","volume-title":"Structural Information and Communication Complexity","author":"B. Katreniak","year":"2005","unstructured":"Katreniak, B.: Biangular circle formation by asynchronous mobile robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 185\u2013199. Springer, Heidelberg (2005)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I. Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal of Computing\u00a028(4), 1347\u20131363 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"9_CR10","first-page":"355","volume":"43","author":"E. Weiszfeld","year":"1937","unstructured":"Weiszfeld, E.: Sur le point pour lequel la somme des distances de n points donnes est minimum, t6hoku math. J\u00a043, 355\u2013386 (1937)","journal-title":"J"},{"issue":"9","key":"9_CR11","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 Trans. Parallel Distrib. Syst.\u00a010(9), 878\u2013887 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T06:53:23Z","timestamp":1560754403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}