{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T07:10:20Z","timestamp":1737097820308,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40026-5_19","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T23:59:07Z","timestamp":1181692747000},"page":"283-296","source":"Crossref","is-referenced-by-count":7,"title":["Locating Information with Uncertainty in Fully Interconnected Networks"],"prefix":"10.1007","author":[{"given":"Lefteris M.","family":"Kirousis","sequence":"first","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"}]},{"given":"Yannis C.","family":"Stamatiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Y. Afek, E. Gafni, and M. Ricklin, Upper and lower bounds for routing schemes in dynamic networks, in: Proc. 30th Symposium on Foundations of Computer Science, (1989), 370\u2013375.","key":"19_CR1","DOI":"10.1109\/SFCS.1989.63505"},{"doi-asserted-by":"crossref","unstructured":"S. Albers and M. Henzinger, Exploring unknown environments, in Proc. 29th Symposium on Theory of Computing, (1999), 416\u2013425.","key":"19_CR2","DOI":"10.1137\/S009753979732428X"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.3233\/JHS-1996-5404","volume":"5","author":"B. Awerbuch","year":"1996","unstructured":"B. Awerbuch, B. Patt-Shamir, and G. Varghese, Self-stabilizing end-to-end communication, Journal of High Speed Networks 5 (1996), 365\u2013381.","journal-title":"Journal of High Speed Networks"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"R.A. Baeza-Yates, J.C. Culberson, and G.J.E. Rawlins, Searching in the plane, Information and Computation 106(2) (1993), 234\u2013252.","journal-title":"Information and Computation"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"D. Bienstock and P. Seymour, Monotonicity in graph searching, Journal of Algorithms 12 (1991), 239\u2013245.","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"R. Cole, B. Maggs, and R. Sitaraman, Routing on butterfly networks with random faults, in: Proc. 36th Symposium on Foundations of Computer Science, (1995), 558\u2013570.","key":"19_CR6","DOI":"10.1109\/SFCS.1995.492586"},{"unstructured":"X. Deng and C. Papadimitriou, Exploring an unknown graph, in Proc: 31st Symposium on Foundations of Computer Science, 1990, 356\u2013361.","key":"19_CR7"},{"unstructured":"S. Dolev, E. Kranakis, D. Krizanc, and D. Peleg, Bubbles: Adaptive routing scheme for high-speed networks, SI AM Journal on Computing, to appear.","key":"19_CR8"},{"doi-asserted-by":"crossref","unstructured":"W. Evans and N. Pippenger, Lower bounds for noisy boolean decision trees, in Proc. 28th Symposium on Theory of Computing, (1996), 620\u2013628.","key":"19_CR9","DOI":"10.1145\/237814.238013"},{"doi-asserted-by":"crossref","unstructured":"U. Fiege, D. Peleg, P. Raghavan, and E. Upfal, Computing with uncertainty, in Proc. 22nd Symposium on Theory of Computing, (1990), 128\u2013137.","key":"19_CR10","DOI":"10.1145\/100216.100230"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"L. Kirousis","year":"1985","unstructured":"L. Kirousis and C. Papadimitriou, Interval graphs and searching, Discrete Mathematics 55 (1985), 181\u2013184.","journal-title":"Discrete Mathematics"},{"unstructured":"E. Kranakis and D. Krizanc, Searching with uncertainty, in: Proc. 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO), (1999), C. Gavoille, J.-C, Bermond, and A. Raspaud, eds., pp, 194\u2013203, Carleton Scientific, 1999.","key":"19_CR12"},{"unstructured":"E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in Proc. 9th Symposium on Discrete Algorithms, 1998, 236\u2013243.","key":"19_CR13"},{"doi-asserted-by":"crossref","unstructured":"T. Leighton and B. Maggs, Expanders might be practical, in: 30th Proc. Symposium on Foundations of Computer Science, (1989), 384\u2013389.","key":"19_CR14","DOI":"10.1109\/SFCS.1989.63507"},{"unstructured":"L. Lovasz, RandomWalks on Graphs: A Survey, Combinatorics 2 (1993), 1\u201346.","key":"19_CR15"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","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 35 (1988), 18\u201344.","journal-title":"Journal of the ACM"},{"unstructured":"P. Panaite and A. Pelc, Exploring unknown undirected graphs, in: Proc. 9th Symposium on Discrete Algorithms, (1998), 316\u2013322.","key":"19_CR17"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C.H. Papadimitriou","year":"1991","unstructured":"C.H. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theoretical Computer Science 84(1) (1991), 127\u2013150.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"N. Pippenger, On networks of noisy gates, in: Proc. 26th Symposium on Foundations of Computer Science, (1985), 30\u201336.","key":"19_CR19","DOI":"10.1109\/SFCS.1985.41"},{"doi-asserted-by":"crossref","unstructured":"P. Raghavan, Robust algorithms for packet routing in a mesh, in: Proc. 1st Symposium on Parallel Algorithms and Architectures, (1989), 344\u2013350.","key":"19_CR20","DOI":"10.1145\/72935.72972"},{"doi-asserted-by":"crossref","unstructured":"T.E.S. Raghavan, T.S. Ferguson, T. Part has apathy, and O. J. Vrieze eds., Stochastic games and related topics. Kluwer Academic Publishers, 1991.","key":"19_CR21","DOI":"10.1007\/978-94-011-3760-7"},{"unstructured":"W.H. Ruckle, Geometric games and their applications. Research Notes in Mathematics, Pitman Publishing Inc., 1983.","key":"19_CR22"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:42:40Z","timestamp":1737096160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}