{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:56Z","timestamp":1725488096859},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426059"},{"type":"electronic","value":"9783540454144"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45414-4_12","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T19:12:40Z","timestamp":1184958760000},"page":"166-179","source":"Crossref","is-referenced-by-count":20,"title":["Mobile Search for a Black Hole in an Anonymous Ring"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"12_CR1","unstructured":"L. Barri\u00e8re, P. Flocchini, P. Fraigniaud, and N. Santoro. Gathering of mobile agents with incomparable labels. Tech.Rep. ECHO-01, Center for e-Computing, 2001."},{"key":"12_CR2","unstructured":"M.A. Bender and D. Slonim. The power of team exploration: Two robots can learn unlabeled directed graphs.In FOCS\u2019 94, pages 75\u201385, 1994."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"B. Brewington, R. Gray, and K. Moizumi. Mobile agents in distributed information retieval. Intelligent Information Agents, pages 355\u2013395, 1999.","DOI":"10.1007\/978-3-642-60018-0_19"},{"issue":"2-4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0020-0255(99)00122-X","volume":"122","author":"W. Chen","year":"2000","unstructured":"W. Chen, C. Leng, and Y. Lien. A novel mobile agent search algorithm. Information Sciences, 122(2-4):227\u2013240, 2000.","journal-title":"Information Sciences"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1142\/S0129626494000387","volume":"4","author":"K. Diks","year":"1994","unstructured":"K. Diks, A. Malinowski, and A. Pelc. Reliable token dispersal with random faults. Parallel Processing Letters, 4:417\u2013427, 1994.","journal-title":"Parallel Processing Letters"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1051\/ita\/1995290503831","volume":"29","author":"K. Diks","year":"1995","unstructured":"K. Diks, A. Malinowski, and A. Pelc. Token transfer in a faulty network. Theoretical Informatics and Applications, 29:383\u2013400, 1995.","journal-title":"Theoretical Informatics and Applications"},{"key":"12_CR7","first-page":"188","volume":"3","author":"K. Diks","year":"1996","unstructured":"K. Diks and A. Pelc. Fault-tolerant linear broadcasting. Nordic Journal of Computing, 3:188\u2013201, 1996.","journal-title":"Nordic Journal of Computing"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Finding a black hole in an arbitrary network.Tech.Rep. ECHO-03, Center for e-Computing, 2001.","DOI":"10.1145\/571825.571853"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF00290707","volume":"24","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich and L. Shrira. Electing a leader in a ring with link failures. Acta Informatica, 24:79\u201391, 1987.","journal-title":"Acta Informatica"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02252955","volume":"5","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich and L. Shrira. On the complexity of computation in the presence of link failures: The case of a ring. Distr. Computing, 5:121\u2013131, 1991.","journal-title":"Distr. Computing"},{"key":"12_CR11","unstructured":"J. Hammer and J. Fiedler. Using mobile crawlers to search the web efficiently. International Journal of Computer and Information Systems.To appear."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"F. Hohl.A framework to protect mobile agents by using reference states.In ICDCS 2000, 2000.","DOI":"10.1109\/ICDCS.2000.840953"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0004-3702(99)00107-1","volume":"117","author":"N.R. Jennings","year":"2000","unstructured":"N.R. Jennings. On agent-based software engineering. Art. Intelligence, 117(2):277\u2013296, 2000.","journal-title":"Art. Intelligence"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"L.M. Kirousis, E. Kranakis, D. Krizanc, and Y.C. Stamatiou. Locating information with uncertainty in fully interconnected networks.In DISC\u2019 00, pages 283\u2013296, 2000.","DOI":"10.1007\/3-540-40026-5_19"},{"key":"12_CR15","unstructured":"K. Moizumi and G. Cybenko. The travelling agent problem. Mathematics of Control, Signal and Systems, 1998."},{"key":"12_CR16","unstructured":"D. Rus, R. Gray, and D. Kotz. Autonomous and adaptive agents that gather information.In AAAI\u2019 96, pages 107\u2013116, 1996."},{"key":"12_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-68671-1_4","volume-title":"Mobile Agents and Security","author":"T. Sander","year":"1998","unstructured":"T. Sander and C.F. Tschudin. Protecting mobile agents against malicious hosts. In Mobile Agents and Security, LNCS 1419, pages 44\u201360, 1998."},{"key":"12_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-48888-X_16","volume-title":"6th Int. Conf. on Intell. and Services in Networks","author":"K. Schelderup","year":"1999","unstructured":"K. Schelderup and J. Ines. Mobile agent security-issues and directions. In 6th Int. Conf. on Intell. and Services in Networks, LNCS 1597, pages 155\u2013167, 1999."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45414-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:02:24Z","timestamp":1556708544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45414-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426059","9783540454144"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45414-4_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}