{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:12Z","timestamp":1760441232604},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_40","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"471-482","source":"Crossref","is-referenced-by-count":17,"title":["Solving the ANTS Problem with Asynchronous Finite State Machines"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Emek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Langner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jara","family":"Uitto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Henzinger, M.: Exploring Unknown Environments. In: SICOMP (2000)","DOI":"10.1137\/S009753979732428X"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: SFCS (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Avin, C., Koucky, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many Random Walks are Faster Than One. In: SPAA (2008)","DOI":"10.1145\/1378533.1378557"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in Networks of Passively Mobile Finite-State Sensors. Distributed Computing (2006)","DOI":"10.1007\/s00446-005-0138-3"},{"key":"40_CR5","unstructured":"Aspnes, J., Ruppert, E.: An Introduction to Population Protocols. In: Middleware for Network Eccentric and Mobile Applications"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the Plane. Information and Computation (1993)","DOI":"10.1006\/inco.1993.1054"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C.: Exploring an Unknown Graph. JGT (1999)","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.3.CO;2-#"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree Exploration with Little Memory. Journal of Algorithms (2004)","DOI":"10.1016\/j.jalgor.2003.10.002"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Emek, Y., Wattenhofer, R.: Stone Age Distributed Computing. In: PODC (2013)","DOI":"10.1145\/2484239.2484244"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Feinerman, O., Korman, A.: Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology. In: DISC (2012)","DOI":"10.1007\/978-3-642-33651-5_5"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Feinerman, O., Korman, A., Lotker, Z., Sereni, J.S.: Collaborative Search on the Plane Without Communication. In: PODC (2012)","DOI":"10.1145\/2332432.2332444"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph Exploration by a Finite Automaton. In: TCS (2005)","DOI":"10.1007\/978-3-540-28629-5_34"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"F\u00f6rster, K.T., Wattenhofer, R.: Directed Graph Exploration. In: OPODIS (2012)","DOI":"10.1007\/978-3-642-35476-2_11"},{"key":"40_CR14","unstructured":"L\u00f3pez-Ortiz, A., Sweet, G.: Parallel Searching on a Lattice. In: CCCG (2001)"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Panaite, P., Pelc, A.: Exploring Unknown Undirected Graphs. In: SODA (1998)","DOI":"10.1006\/jagm.1999.1043"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Prabhakar, B., Dektar, K.N., Gordon, D.M.: The Regulation of Ant Colony Foraging Activity Without Spatial Information. PLoS Computational Biology (2012)","DOI":"10.1371\/journal.pcbi.1002670"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected Connectivity in Log-Space. JACM (2008)","DOI":"10.1145\/1391289.1391291"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:33:12Z","timestamp":1558909992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}