{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:54:07Z","timestamp":1725767647729},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781475752755"},{"type":"electronic","value":"9780387356082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-0-387-35608-2_18","type":"book-chapter","created":{"date-parts":[[2013,12,29]],"date-time":"2013-12-29T16:57:25Z","timestamp":1388336245000},"page":"206-216","source":"Crossref","is-referenced-by-count":1,"title":["Memoryless Search Algorithms in a Network with Faulty Advice"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Hanusse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Kavvadias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01300124","volume":"16","author":"Y Azar","year":"1996","unstructured":"Y. Azar, A. Broder, A. Karlin, N. Linial, and S. Phillips. Biased random walks. Combinatorica, 16: 1\u201318, 1996.","journal-title":"Combinatorica"},{"key":"18_CR2","unstructured":"AF] D.J. Aldous and J.A. Fill. Reversible markov chains and random walks on graphs. (book in preparation, available on the web from \n                      http:\/\/www.stat.berkeley.edu"},{"key":"18_CR3","first-page":"218","volume-title":"Proc. 20th FOCS","author":"R Aleliunas","year":"1979","unstructured":"R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences and the complexity of maze problems. In Proc. 20th FOCS, pages 218\u2013223, 1979."},{"key":"18_CR4","first-page":"543","volume-title":"Proc. STOC","author":"A Broder","year":"1989","unstructured":"A. Broder, A. K. Karlin, P. Raghavan, and E. Upfal. Trading space for time in undirected s \u2014 t connedtivity. In Proc. STOC, pages 543\u2013549, 1989."},{"key":"18_CR5","volume-title":"Information and Computation","author":"R Baeza-Yates","year":"1993","unstructured":"R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 1993."},{"key":"18_CR6","unstructured":"HKK00] N. Hanusse, E. Kranakis, and K. Krizanc. Searching with mobile agents"},{"key":"18_CR7","unstructured":"in networks with liars. In Proc. EUROPA R\u20192000, LNCS 1900,pages 583\u2013590, Munich, 2000."},{"key":"18_CR8","first-page":"194","volume-title":"Proc. SIROCCO\u201999, Carleton Scientific","author":"E Kranakis","year":"1999","unstructured":"E. Kranakis and D. Krizanc. Searching with uncertainty. In Proc. SIROCCO\u201999, Carleton Scientific, pages 194\u2013203, 1999."},{"key":"18_CR9","first-page":"283","volume-title":"Proc. DISC2000, LNCS 1914","author":"LM Kirousis","year":"2000","unstructured":"L. M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou. Locating information with uncertainty in fully interconnected networks. In Proc. DISC\u20192000, LNCS\n                              1914, pages 283\u2013296, Toledo, Spain, 2000."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-1-4612-0801-3_7","volume-title":"Discrete Probability and Algorithms, Institute of Mathematics and its Applications, Vol., 72, Springer Verlag, 1995","author":"AR Karlin","year":"1995","unstructured":"A. R. Karlin and P. Raghavan. Random walks and undirected graph connectivity: A survey. In Discrete Probability and Algorithms, Institute of Mathematics and its Applications, Vol., 72, Springer Verlag, 1995, pages 95\u2013101, 1995."},{"key":"18_CR11","volume-title":"Journal of the ACM","author":"N Megiddo","year":"1988","unstructured":"N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou. The complexity of searching a graph. Journal of the ACM, 1988."},{"key":"18_CR12","volume-title":"Cambridge Uni-versity Press","author":"R Motwani","year":"1995","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge Uni-versity Press, 1995."},{"key":"18_CR13","volume-title":"Cambridge University Press","author":"JR Norris","year":"1997","unstructured":"J.R. Norris. Markov Chains. Cambridge University Press, 1997."}],"container-title":["Foundations of Information Technology in the Era of Network and Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-35608-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:47:01Z","timestamp":1557780421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35608-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781475752755","9780387356082"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35608-2_18","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}