Delayed correction -- binary search with errors made very simple but efficient

MaRDI QIDQ4953350zbMATH OpenFDO

Authors Frank Albers, Peter Damaschke

Publication date 9 May 2000

zbMATH Keywords

average case complexityerror-toleranceimplementationrandomizationsearching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Coping with errors in binary search procedures (Preliminary Report)
• Searching with known error probability
• Binary search with errors and variable cost queries
• Least adaptive optimal search with unreliable tests

Cited in

(4)

• Binary search with delayed and missing answers
• Robust and adaptive search
• Coping with errors in binary search procedures (Preliminary Report)
• Searching games with errors -- fifty years of coping with liars

This page was built for publication: Delayed correction -- binary search with errors made very simple but efficient

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