Pages that link to "Item:Q1090471"
From MaRDI portal
The following pages link to Solution of Ulam's problem on searching with a lie (Q1090471):
Displaying 45 items.
- On error correction with errors in both the channel and syndrome (Q259902) (← links)
- Binary search with errors and variable cost queries (Q293463) (← links)
- Signature codes for noisy multiple access adder channel (Q510479) (← links)
- \(Q\)-ary Rényi-Ulam pathological liar game with one lie (Q628343) (← links)
- An algorithm for ``Ulam's Game'' and its application to error correcting codes (Q671940) (← links)
- Finding the maximum and minimum (Q678861) (← links)
- Two cooperative versions of the guessing secrets problem (Q730944) (← links)
- Ulam's searching game with two lies (Q749204) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- A simple solution to Ulam's liar game with one lie (Q952012) (← links)
- How to play the one-lie Rényi-Ulam game (Q998465) (← links)
- Two-batch liar games on a general bounded channel (Q1040842) (← links)
- Prefix search with a lie (Q1102755) (← links)
- Searching with known error probability (Q1115619) (← links)
- Detecting errors in searching games (Q1119495) (← links)
- Ulam's searching game with lies (Q1121815) (← links)
- Ulam's searching game with a fixed number of lies (Q1184984) (← links)
- Solution of Ulam's problem on binary search with three lies (Q1185893) (← links)
- Searching with lies: The Ulam problem (Q1199612) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- Optimal comparison strategies in Ulam's searching game with two errors (Q1391131) (← links)
- The halflie problem. (Q1399909) (← links)
- Perfect two-fault tolerant search with minimum adaptiveness (Q1585493) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- An improved heuristic for the ``Ulam-Rényi game'' (Q1607032) (← links)
- Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
- Ulam's searching game with three lies (Q1802349) (← links)
- Strategies for the Renyi--Ulam game with fixed number of lies (Q1884914) (← links)
- A halfliar's game (Q1884996) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- Continuous guessing games with two secret numbers (Q2163441) (← links)
- Coding with noiseless feedback (Q2364460) (← 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)
- 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 Interval Liar Game (Q3439615) (← links)
- Three Thresholds for a Liar (Q4291186) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies (Q5962511) (← links)
- Correcting a single error in feedback channels (Q6173470) (← links)
