Memoryless search algorithms in a network with faulty advice

DOI10.1016/J.TCS.2008.04.034MaRDI QIDQ935471zbMATH OpenOpenAlexFDO

Authors Nicolas Hanusse, Evangelos Kranakis, D. Krizanc, Dimitris J. Kavvadias

Publication date 6 August 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.04.034

zbMATH Keywords

distributed computingrandomized algorithmsrandom walksgraph searchingfaulty networksmobile agent computing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1003301
• Memory lower bounds for randomized collaborative search and implications for biology
• Deterministic Decentralized Search in Random Graphs
• Deterministic Decentralized Search in Random Graphs
• Perfect two-fault tolerant search with minimum adaptiveness
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Optimal resilient sorting and searching in the presence of memory faults
• Complex networks and decentralized search algorithms
• An efficient adaptive strategy for searching in peer-to-peer networks

Cites work

• Biased random walks
• Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval
• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
• Markov Chains
• Searching with mobile agents in networks with liars.

Cited in

(9)

• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
• Querying with Uncertainty
• Searching a Tree with Permanently Noisy Advice
• Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
• Searching with mobile agents in networks with liars.
• Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval
• Treasure hunt with barely communicating agents
• The impact of dynamic events on the number of errors in networks
• scientific article; zbMATH DE number 1696681 (Why is no real title available?)

This page was built for publication: Memoryless search algorithms in a network with faulty advice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935471)