Locating a target with an agent guided by unreliable local advice

DOI10.1145/1835698.1835781zbMath1315.68018OpenAlexW2156875786MaRDI QIDQ5176212

Nicolas Nisse, Nicolas Hanusse, David Ilcinkas, Adrian Kosowski

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1835698.1835781

zbMATH Keywords

random walksdistributed computingmobile agentsexpandersfaulty networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items (4)

The impact of dynamic events on the number of errors in networks ⋮ Querying with Uncertainty ⋮ Searching a Tree with Permanently Noisy Advice ⋮ Slowdown for the geodesic-biased random walk

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Locating a target with an agent guided by unreliable local advice