{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T14:04:11Z","timestamp":1649167451626},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T00:00:00Z","timestamp":1193184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00224-007-9065-y","type":"journal-article","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T10:45:38Z","timestamp":1193136338000},"page":"1-26","source":"Crossref","is-referenced-by-count":1,"title":["Fault-Tolerant Sequential Scan"],"prefix":"10.1007","volume":"45","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"9065_CR1","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29, 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"key":"9065_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. In: Proc. 30th Ann. Symp. on Theory of Computing (STOC 1998), pp.\u00a0269\u2013278","DOI":"10.1145\/276698.276759"},{"key":"9065_CR3","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Searching for a black hole in tree networks. In: Proc. 8th International Conference on Principles of Distributed Systems (OPODIS 2004), pp.\u00a035\u201345","DOI":"10.1007\/11516798_5"},{"key":"9065_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.tcs.2004.07.031","volume":"326","author":"A. Dessmark","year":"2004","unstructured":"Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. Theor. Comput. Sci. 326, 343\u2013362 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9065_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00453-006-1232-z","volume":"48","author":"S. Dobrev","year":"2007","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48(1), 67\u201390 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"9065_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-006-0154-y","volume":"19","author":"S. Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distrib. Comput. 19(1) 1\u201319 (2006)","journal-title":"Distrib. Comput."},{"key":"9065_CR7","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. In: Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp.\u00a0807\u2013814","DOI":"10.1145\/1159892.1159897"},{"key":"9065_CR8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","volume":"17","author":"F.E. Fich","year":"1988","unstructured":"Fich, F.E., Ragde, P., Wigderson, A.: Relations between concurrent-write models of parallel computation. SIAM J. Comput. 17, 606\u2013627 (1988)","journal-title":"SIAM J. Comput."},{"key":"9065_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P.C. Kanellakis","year":"1992","unstructured":"Kanellakis, P.C., Shvartsman, A.A.: Efficient parallel algorithms can be made robust. Distrib. Comput. 5, 201\u2013217 (1992)","journal-title":"Distrib. Comput."},{"key":"9065_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s00224-005-1252-0","volume":"40","author":"E. Markou","year":"2007","unstructured":"Markou, E., Pelc, A.: Efficient exploration of faulty trees. Theory Comput. Syst. 40, 225\u2013247 (2007)","journal-title":"Theory Comput. Syst."},{"key":"9065_CR11","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Reif, J.H.: Parallel tree contraction and its application. In: Proc. 26th Symp. on Foundations of Computer Science (FOCS 1985), pp.\u00a0478\u2013489","DOI":"10.1109\/SFCS.1985.43"},{"key":"9065_CR12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorithms 33, 281\u2013295 (1999)","journal-title":"J. Algorithms"},{"key":"9065_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","volume":"28","author":"A. Pelc","year":"1996","unstructured":"Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks 28, 143\u2013156 (1996)","journal-title":"Networks"},{"key":"9065_CR14","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"16","author":"F. Preparata","year":"1967","unstructured":"Preparata, F., Metze, G., Chien, R.: On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput. 16, 848\u2013854 (1967)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"9065_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/3-540-68671-1_4","volume-title":"Proc. Conf. on Mobile Agent Security","author":"T. Sander","year":"1998","unstructured":"Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In: Proc. Conf. on Mobile Agent Security. Lecture Notes in Computer Science, vol.\u00a01419, pp.\u00a044\u201360. Springer, Berlin (1998)"},{"key":"9065_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-48888-X_16","volume-title":"Proc. 6th Int. Conf. on Intelligence and Services in Networks","author":"K. Schelderup","year":"1999","unstructured":"Schelderup, K., Ines, J.: Mobile agent security\u2014issues and directions. In: Proc. 6th Int. Conf. on Intelligence and Services in Networks. Lecture Notes in Computer Science, vol. 1597, pp. 155\u2013167. Springer, Berlin (1999)"},{"key":"9065_CR17","unstructured":"Vitek, J., Castagna, G.: Mobile computations and hostile hosts. In: Tsichritzis, D. (ed.) Mobile Objects, University of Geneva, pp.\u00a0241\u2013261 (1999)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9065-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9065-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9065-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:34Z","timestamp":1558684294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9065-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9065"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9065-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,24]]}}}