scientific article; zbMATH DE number 742943
From MaRDI portal
Publication:4763384
Recommendations
Cited in
(26)- Sorting and searching in faulty memories
- The price of resiliency: a case study on sorting with memory faults
- On-line learning of rectangles and unions of rectangles
- Playing by searching: Two strategies against a linearly bounded liar
- Drifting games and Brownian motion
- An efficient noisy binary search in graphs via Median approximation
- Twenty (short) questions
- Truth tellers and liars with fewer questions
- The liar game over an arbitrary channel
- Perfect minimally adaptive \(q\)-ary search with unreliable tests
- Liar!
- scientific article; zbMATH DE number 3843531 (Why is no real title available?)
- Dealing with liars: misbehavior identification via Rényi-Ulam games
- Question/Answer Games on Towers and Pyramids
- Designing reliable algorithms in unreliable memories
- scientific article; zbMATH DE number 2119668 (Why is no real title available?)
- Perfect strategies for the Ulam-Rényi game with multi-interval questions
- Twenty (simple) questions
- How to Play the Majority Game with Liars
- The Two-Batch Liar Game over an Arbitrary Channel
- Searching games with errors -- fifty years of coping with liars
- Least adaptive optimal search with unreliable tests
- “Two Truths and a Lie” as a Class-Participation Activity
- Noisy (binary) searching: simple, fast and correct
- Coping with known patterns of lies in a search game
- How to play the majority game with a liar
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763384)
