The following pages link to (Q5568914):
Displaying 39 items.
- Binary search with errors and variable cost queries (Q293463) (← links)
- Linear-code multicast on parallel architectures (Q427139) (← links)
- Perfect strategies for the Ulam-Rényi game with multi-interval questions (Q489747) (← 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)
- The Rényi-Ulam games and many-valued logics (Q679806) (← links)
- Ulam's searching game with two lies (Q749204) (← links)
- Coping with known patterns of lies in a search game (Q797505) (← 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 one-lie Rényi-Ulam game (Q998465) (← links)
- Two-batch liar games on a general bounded channel (Q1040842) (← links)
- Solution of Ulam's problem on searching with a lie (Q1090471) (← links)
- Ulam's searching game with lies (Q1121815) (← links)
- Coping with errors in binary search procedures (Q1144379) (← links)
- Solution of Ulam's problem on binary search with three lies (Q1185893) (← links)
- Searching with lies: The Ulam problem (Q1199612) (← 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)
- 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)
- Conditioning a state by a Łukasiewicz event: a probabilistic approach to Ulam games (Q1978507) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- Algorithms for \(q\)-ary error-correcting codes with limited magnitude and feedback (Q2214047) (← links)
- Bounds for the capacity error function for unidirectional channels with noiseless feedback (Q2219054) (← links)
- On using noisy feedback in a Gaussian channel (Q2263006) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- The Rényi-Ulam pathological liar game with a fixed number of lies (Q2575810) (← links)
- Searching with lies under error transition cost constraints (Q3439239) (← links)
- Q-ary Ulam-Rényi game with constrained lies (Q3439260) (← links)
- Reliable minimum finding comparator networks (Q5096888) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)
- On the Rényi-Ulam game with restricted size queries (Q6108923) (← links)
- Correcting a single error in feedback channels (Q6173470) (← links)
