{"id":"https://openalex.org/W1559243181","doi":"https://doi.org/10.1007/978-0-387-35608-2_18","title":"Memoryless Search Algorithms in a Network with Faulty Advice","display_name":"Memoryless Search Algorithms in a Network with Faulty Advice","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1559243181","doi":"https://doi.org/10.1007/978-0-387-35608-2_18","mag":"1559243181"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-35608-2_18","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35608-2_18","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35608-2_18.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations of Information Technology in the Era of Network and Mobile Computing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35608-2_18.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047477217","display_name":"Nicolas Hanusse","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nicolas Hanusse","raw_affiliation_strings":["LaBRI - CNRS - Universit\u00e9 Bordeaux I, 351 Cours de la Liberation, 33405, Talence, France"],"affiliations":[{"raw_affiliation_string":"LaBRI - CNRS - Universit\u00e9 Bordeaux I, 351 Cours de la Liberation, 33405, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I1294671590","https://openalex.org/I4210142254"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111740824","display_name":"Dimitris J. Kavvadias","orcid":null},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Dimitris Kavvadias","raw_affiliation_strings":["Department of Mathematics, University of Patras, Rio, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Patras, Rio, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003125546","display_name":"Evangelos Kranakis","orcid":"https://orcid.org/0000-0002-8959-4428"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Evangelos Kranakis","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, ON, K1S 5B6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058262792","display_name":"Danny Kriz\u0327anc","orcid":"https://orcid.org/0000-0002-0941-4010"},"institutions":[{"id":"https://openalex.org/I100538780","display_name":"Wesleyan University","ror":"https://ror.org/05h7xva58","country_code":"US","type":"education","lineage":["https://openalex.org/I100538780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Danny Krizanc","raw_affiliation_strings":["Department of Mathematics, Wesleyan University, Middletown, CT, 06459, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Wesleyan University, Middletown, CT, 06459, USA","institution_ids":["https://openalex.org/I100538780"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047477217"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254"],"apc_list":null,"apc_paid":null,"fwci":0.2801,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.6296749,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"206","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9753999710083008,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7418138980865479},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.7071981430053711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6360482573509216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5380368828773499},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5359472036361694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.526557445526123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5010528564453125},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4998002052307129},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4824550747871399},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44587212800979614},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4444936513900757},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4236489534378052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35860177874565125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.340902715921402},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11344099044799805},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10609742999076843}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7418138980865479},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.7071981430053711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6360482573509216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5380368828773499},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5359472036361694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.526557445526123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5010528564453125},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4998002052307129},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4824550747871399},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44587212800979614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4444936513900757},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4236489534378052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35860177874565125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.340902715921402},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11344099044799805},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10609742999076843},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-0-387-35608-2_18","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35608-2_18","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35608-2_18.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations of Information Technology in the Era of Network and Mobile Computing","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.5137","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scs.carleton.ca/~kranakis/Papers/tcs2002-final.ps.gz","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00341468v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00341468","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 2008, 402 (2-3), pp.190-198","raw_type":"Journal articles"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/198624","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/198624","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":{"id":"doi:10.1007/978-0-387-35608-2_18","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-35608-2_18","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-0-387-35608-2_18.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Foundations of Information Technology in the Era of Network and Mobile Computing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322675","display_name":"Mitacs","ror":"https://ror.org/00cjrc276"},{"id":"https://openalex.org/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1559243181.pdf","grobid_xml":"https://content.openalex.org/works/W1559243181.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1499479569","https://openalex.org/W1504137659","https://openalex.org/W1564575922","https://openalex.org/W1586184796","https://openalex.org/W2156184725","https://openalex.org/W2504389667","https://openalex.org/W2610278296","https://openalex.org/W6603766759","https://openalex.org/W6622243269","https://openalex.org/W6655323535","https://openalex.org/W6658308639","https://openalex.org/W6697355399"],"related_works":["https://openalex.org/W3090906284","https://openalex.org/W253876680","https://openalex.org/W1987931999","https://openalex.org/W4293797372","https://openalex.org/W4238052600","https://openalex.org/W3005176110","https://openalex.org/W162918864","https://openalex.org/W4243730168","https://openalex.org/W2912586490","https://openalex.org/W2728955940"],"abstract_inverted_index":{"In":[0],"this":[1,170],"paper,":[2],"we":[3,111],"present":[4],"a":[5,9,20,23,38,60,78,95],"randomized":[6],"algorithm":[7,81],"for":[8,14,179],"mobile":[10],"agent":[11],"to":[12,51,63,119,123],"search":[13],"an":[15],"item":[16],"t":[17,64,125],"stored":[18],"at":[19],"node":[21,33,103,145],"of":[22,28,34,44,101,106,117,173],"network,":[24],"without":[25],"prior":[26],"knowledge":[27],"its":[29],"exact":[30],"location.":[31],"Each":[32],"the":[35,45,56,84,99,114,138,141,184,187,190],"network":[36],"has":[37],"database":[39],"that":[40,68,113,169],"will":[41],"answer":[42],"queries":[43],"form":[46],"\u201chow":[47],"do":[48],"I":[49],"get":[50],"t?\u201d":[52],"by":[53,130],"responding":[54],"with":[55,86],"first":[57],"edge":[58],"on":[59],"shortest":[61],"path":[62],"It":[65],"may":[66],"happen":[67],"some":[69,87],"nodes,":[70],"called":[71],"liars,":[72],"give":[73],"bad":[74],"advice.":[75],"We":[76,166],"investigate":[77],"simple":[79],"memoryless":[80],"which":[82],"follows":[83],"advice":[85],"fixed":[88],"probability":[89],"q":[90],">1/2":[91],"and":[92,104,143,146,189],"otherwise":[93],"chooses":[94],"random":[96],"edge.":[97],"If":[98],"degree":[100],"each":[102],"number":[105,116,172],"liars":[107],"k":[108,134],"are":[109],"bounded,":[110],"show":[112,168],"expected":[115,171],"edges":[118],"follow":[120],"in":[121],"order":[122],"reach":[124],"is":[126,137],"bounded":[127],"from":[128],"above":[129],"O(d":[131],"+":[132],"r":[133],")where":[135],"d":[136],"distance":[139],"between":[140],"initial":[142],"target":[144],"%":[147,149,151,153,155,157,159],"MathType!MTEF!2!1!+-":[148],"feaagGart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn":[150],"hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr":[152],"4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9":[154],"vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x":[156],"fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaamOCaiabg2":[158],"da9maalaaabaGaamyCaaqaaiaaigdacqGHsislcaWGXbaaaaaa!3B96!":[160],"\\[r":[161],"=":[162],"\\frac{q}{{1":[163],"-":[164],"q}}\\":[165],"also":[167],"steps":[174],"can":[175],"be":[176],"significantly":[177],"improved":[178],"particular":[180],"topologies":[181],"such":[182],"as":[183],"complete":[185],"graph,":[186],"torus,":[188],"spider":[191],"graph.":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}