Optimal binary search with two unreliable tests and minimum adaptiveness

DOI10.1007/3-540-48481-7_23MaRDI QIDQ4938780zbMATH OpenFDO

Authors Ferdinando Cicalese, Daniele Mundici

Publication date 27 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48481-7_23

zbMATH Keywords

Berlekamp's minimum numbercorrecting codeerror-correcting communication

Mathematics Subject Classification ID

Combinatorial games (91A46) Discrete-time games (91A50) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Least adaptive optimal search with unreliable tests
• scientific article; zbMATH DE number 1226239
• scientific article; zbMATH DE number 1617287
• Perfect minimally adaptive \(q\)-ary search with unreliable tests
• Perfect two-fault tolerant search with minimum adaptiveness

Cited in

(12)

• Perfect two-fault tolerant search with minimum adaptiveness
• An improved heuristic for the ``Ulam-Rényi game
• Perfect minimally adaptive \(q\)-ary search with unreliable tests
• Exact learning from an honest teacher that answers membership queries
• scientific article; zbMATH DE number 1617287 (Why is no real title available?)
• Binary search with errors and variable cost queries
• Searching with lies under error transition cost constraints
• scientific article; zbMATH DE number 2100868 (Why is no real title available?)
• Algorithms and Computation
• Searching games with errors -- fifty years of coping with liars
• Least adaptive optimal search with unreliable tests
• Searching with lies under error cost constraints

This page was built for publication: Optimal binary search with two unreliable tests and minimum adaptiveness

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