Sharp noisy binary search with monotonic probabilities

DOI10.4230/LIPICS.ICALP.2024.75MaRDI QIDQ6875121zbMATH OpenFDO

Authors Lucas Gretta, Eric Price

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.75

zbMATH Keywords

fine-grained algorithmsnoisy binary searchrandomized/probabilistic methodssublinear/streaming algorithms

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Bisection search with noisy responses
• Deterministic and probabilistic binary search in graphs
• scientific article; zbMATH DE number 3513625 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• Noisy Adaptive Group Testing via Noisy Binary Search
• Noisy binary search and its applications
• Sample-optimal identity testing with high probability
• Searching games with errors -- fifty years of coping with liars

Cited in

(1)

• Noisy (binary) searching: simple, fast and correct

This page was built for publication: Sharp noisy binary search with monotonic probabilities

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