{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:40Z","timestamp":1725564820923},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_11","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"111-122","source":"Crossref","is-referenced-by-count":20,"title":["Improved Bounds for Optimal Black Hole Search with a Network Map"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The Rendezvous search problem. SIAM J. of Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. of Control and Optimization"},{"key":"11_CR2","unstructured":"Arkin, E., Bender, M., Fekete, S., Mitchell, J.: The freeze-tag problem: how to wake up a swarm of robots. In: 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 568\u2013577 (2002)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B. Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Singh, M.: Piecemeal graph learning by a mobile robot. Information and Computation\u00a0152, 155\u2013172 (1999)","journal-title":"Information and Computation"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"L. Barri\u00e9re, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. In 14th ACM-SIAM Symp. on Parallel Algorithms and Architectures (SPAA \u201902), 200-209, 2002.","DOI":"10.1145\/564870.564906"},{"key":"11_CR5","unstructured":"Barri\u00e9re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and rendezvous in fully anonymous systems with sense of direction. In: 10th Colloquium on Structural Information and Communication complexity (SIROCCO 2003), pp. 17\u201332 (2003)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. of Graph Theory\u00a032, 265\u2013297 (1999)","journal-title":"J. of Graph Theory"},{"key":"11_CR7","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":"11_CR8","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. In: 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 588\u2013597 (2002)"},{"key":"11_CR9","unstructured":"Dobrev, S., Flocchini, P., Kr\u00e1l\u2019ovi\u010d, R., Prencipe, G., Ru\u017ei\u010dka, P., Santoro, N.: Optimal search for a black hole in common interconnection networks. In: Proc. of Symposium on Principles of Distributed Systems, OPODIS 2002 (2002)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45414-4_12","volume-title":"Distributed Computing","author":"S. Dobrev","year":"2001","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile agents searching for a black hole in an anonymous ring. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 166\u2013179. Springer, Heidelberg (2001)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: Optimal mobile agent protocols. In: Proc. of 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 153\u2013162 (2002)","DOI":"10.1145\/571825.571853"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Hohl, F.: A Model of attacks of malicious hosts against mobile agents. In: Secure Internet Programming. LNCS, vol.\u00a01603, pp. 105\u2013120 (1998)","DOI":"10.1007\/3-540-49255-0_77"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: 23rd International Conference on Distributed Computing Systems, ICDCS 2003 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"issue":"12","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/S0140-3664(99)00083-3","volume":"22","author":"R. Oppliger","year":"1999","unstructured":"Oppliger, R.: Security issues related to mobile code and agent-based systems. Computer Communications\u00a022(12), 1165\u20131170 (1999)","journal-title":"Computer Communications"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","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":"Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol.\u00a01419, pp. 44\u201360. Springer, Heidelberg (1998)"},{"key":"11_CR16","unstructured":"Vitek, J., Castagna, G.: Mobile computations and hostile hosts. In: Tsichritzis, D. (ed.) Mobile Objects, pp. 241\u2013261. University of Geneva (1999)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:20:54Z","timestamp":1605759654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}