An almost optimal algorithm for unbounded search with noisy information

DOI10.4230/LIPICS.SWAT.2022.25MaRDI QIDQ6544082zbMATH OpenFDO

Authors Junhao Gan, Anthony Wirth, Xin Zhang

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2022.25

zbMATH Keywords

fault-tolerant searchnoisy binary searchquery complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Complexity of round-robin allocation with potentially noisy queries
• Complexity of round-robin allocation with potentially noisy queries

This page was built for publication: An almost optimal algorithm for unbounded search with noisy information

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