Pages that link to "Item:Q5958303"

The following pages link to Searching games with errors -- fifty years of coping with liars (Q5958303):

Displaying 50 items.

• Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
• Designing reliable algorithms in unreliable memories (Q458451) (← links)
• Propositional dynamic logic for searching games with errors (Q472791) (← links)
• Perfect strategies for the Ulam-Rényi game with multi-interval questions (Q489747) (← links)
• Resilient dynamic programming (Q513272) (← links)
• \(Q\)-ary Rényi-Ulam pathological liar game with one lie (Q628343) (← links)
• Recursive merge sort with erroneous comparisons (Q642963) (← links)
• The Rényi-Ulam games and many-valued logics (Q679806) (← links)
• Finding the maximum and minimum elements with one lie (Q708325) (← links)
• Product logic and probabilistic Ulam games (Q876494) (← links)
• Searching with lies under error cost constraints (Q947085) (← links)
• A simple solution to Ulam's liar game with one lie (Q952012) (← links)
• How to play the majority game with a liar (Q960976) (← links)
• How to play the one-lie Rényi-Ulam game (Q998465) (← links)
• Sorting and searching in faulty memories (Q1006385) (← links)
• Binary search with delayed and missing answers (Q1007537) (← links)
• The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
• Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
• The halflie problem. (Q1399909) (← links)
• Binary search in graphs revisited (Q1741841) (← links)
• On searching strategies, parallel questions, and delayed answers (Q1765232) (← links)
• Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
• Strategies for the Renyi--Ulam game with fixed number of lies (Q1884914) (← links)
• Typical rounding problems (Q1884960) (← links)
• European tenure games (Q1884995) (← links)
• A halfliar's game (Q1884996) (← links)
• Optimal dislocation with persistent errors in subquadratic time (Q1987515) (← links)
• Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
• Continuous guessing games with two secret numbers (Q2163441) (← links)
• On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice (Q2290640) (← links)
• Truth tellers and liars with fewer questions (Q2342617) (← links)
• Complexity of question/answer games (Q2378516) (← links)
• \(Q\)-ary search with one Lie and bi-interval queries (Q2379948) (← links)
• Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
• Computing majority via multiple queries (Q2453124) (← links)
• Minimal average cost of searching for a counterfeit coin: restricted model (Q2506364) (← links)
• Searching for a counterfeit coin with \(b\)-balance (Q2506365) (← links)
• Searching for a counterfeit coin with two unreliable weighings (Q2565856) (← links)
• The Rényi-Ulam pathological liar game with a fixed number of lies (Q2575810) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• The Query Complexity of Finding a Hidden Permutation (Q2848962) (← links)
• Open Problems on Search Games (Q2961395) (← links)
• An Asymptotic Solution of Dresher’s Guessing Game (Q3098098) (← links)
• (Q3300812) (← links)
• Optimal Dislocation with Persistent Errors in Subquadratic Time (Q3304135) (← links)
• Searching with lies under error transition cost constraints (Q3439239) (← links)
• The Interval Liar Game (Q3439615) (← links)
• (Q4633073) (← links)
• Searching a Tree with Permanently Noisy Advice (Q5009618) (← links)
• (Q5075792) (← links)