{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:54:50Z","timestamp":1725573290650},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_16","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T06:34:15Z","timestamp":1149230055000},"page":"139-150","source":"Crossref","is-referenced-by-count":20,"title":["Black Hole Search in Asynchronous Rings Using Tokens"],"prefix":"10.1007","author":[{"given":"S.","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"R.","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"N.","family":"Santoro","sequence":"additional","affiliation":[]},{"given":"W.","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and rendezvous in fully anonymous systems with sense of direction. Theory of Computing Systems (to appear, 2006); Preliminary version in Proc. of SIROCCO 2003"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-68671-1_1","volume-title":"Mobile Agents and Security","author":"D.M. Chess","year":"1998","unstructured":"Chess, D.M.: Security issues in mobile code systems. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol.\u00a01419, pp. 1\u201314. Springer, Heidelberg (1998)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11516798_5","volume-title":"Principles of Distributed Systems","author":"J. Czyzowicz","year":"2005","unstructured":"Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Searching for a black hole in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol.\u00a03544, pp. 67\u201380. Springer, Heidelberg (2005)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Kralovic, R., Prencipe, G., Ruzicka, P., Santoro, N.: Optimal search for a black hole in common interconnection networks. Networks (to appear, 2006); Preliminary version in Proc. of OPODIS 2002","DOI":"10.1002\/net.20095"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica (to appear, 2006); Preliminary version in Proc. of DISC 2001","DOI":"10.1007\/s00453-006-1232-z"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in a arbitrary networks: optimal mobile agent protocols. Distributed Computing (to appear, 2006); Preliminary version in Proc. of PODC 2002","DOI":"10.1007\/s00446-006-0154-y"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Santoro, N.: Improved bounds for optimal black hole search in a network with a map. In: Proc. of 10th International Colloquium on Structural Information and Communication Complexity, pp. 111\u2013122 (2004)","DOI":"10.1007\/978-3-540-27796-5_11"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D., Pelc, A.: Collective tree exploration. In: 6th Latin American Theoretical Informatics Symp., pp. 141\u2013151 (2004)","DOI":"10.1007\/978-3-540-24698-5_18"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D.: Digraph exploration with little memory. In: 21st Symp. on Theoretical Aspects of Computer Science, pp. 246\u2013257 (2004)","DOI":"10.1007\/978-3-540-24749-4_22"},{"issue":"7","key":"16_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/35.689634","volume":"36","author":"M.S. Greenberg","year":"1998","unstructured":"Greenberg, M.S., Byington, J.C., Harper, D.G.: Mobile agents and security. IEEE Commun. Mag.\u00a036(7), 76\u201385 (1998)","journal-title":"IEEE Commun. Mag."},{"key":"16_CR11","series-title":"LNCS","first-page":"105","volume-title":"Proc. of the ECOOP Workshop on Distributed Object Security and 4th Workshop on Mobile Object Systems","author":"F. Hohl","year":"1998","unstructured":"Hohl, F.: A model of attacks of malicious hosts against mobile agents. In: Proc. of the ECOOP Workshop on Distributed Object Security and 4th Workshop on Mobile Object Systems. LNCS, vol.\u00a01603, pp. 105\u2013120. Springer, Heidelberg (1998)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11429647_17","volume-title":"Structural Information and Communication Complexity","author":"R. Klasing","year":"2005","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 200\u2013215. Springer, Heidelberg (2005)"},{"issue":"12","key":"16_CR13","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":"16_CR14","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)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:04:19Z","timestamp":1619492659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11758471_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}