Navigating in Trees with Permanently Noisy Advice

DOI10.1145/3448305MaRDI QIDQ5032023zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

average case analysiscomputation in unreliable conditionsexpectation versus high probability performancesnavigation with adviceworst-case analysis

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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

Cited in

(4)

• Searching a Tree with Permanently Noisy Advice
• The faulty Satnav (GPS) problem: search for home in networks with unreliable directions
• Playing Guess Who with your kids: code-word strategy against adversaries
• The query complexity of searching trees 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)