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

zbMATH Keywords

query complexityfault-tolerant searchnoisy binary search

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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)