Navigating in Trees with Permanently Noisy Advice

DOI10.1145/3448305OpenAlexW3168067270MaRDI QIDQ5032023FDOQ5032023

Authors: Lucas Boczkowski, Amos Korman, Yoav Rodeh, Uriel Feige 

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

Recommendations

• Searching a Tree with Permanently Noisy Advice
• Memoryless search algorithms in a network with faulty advice
• Treasure hunt with advice
• A framework for searching in graphs in the presence of errors
• scientific article; zbMATH DE number 1696681

zbMATH Keywords

worst-case analysisaverage case analysiscomputation in unreliable conditionsexpectation versus high probability performancesnavigation with advice

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (3)

• The faulty Satnav (GPS) problem: search for home in networks with unreliable directions
• Playing Guess Who with your kids: code-word strategy against adversaries
• Searching a Tree with Permanently Noisy Advice

This page was built for publication: Navigating in Trees with Permanently Noisy Advice

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