The following pages link to (Q4121861):
Displaying 50 items.
- On error correction with errors in both the channel and syndrome (Q259902) (← links)
- Nonlinear waves described by a fifth-order equation derived from the Fermi-Pasta-Ulam system (Q327254) (← links)
- On the last question of Stefan Banach (Q346269) (← 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)
- 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)
- The Rényi-Ulam games and many-valued logics (Q679806) (← links)
- Complex systems, modelling and simulation (Q720394) (← links)
- Ulam's searching game with two lies (Q749204) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← 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)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- Two-batch liar games on a general bounded channel (Q1040842) (← links)
- Kurt Gödel in sharper focus (Q1063582) (← links)
- Solution of Ulam's problem on searching with a lie (Q1090471) (← links)
- Mathematical problems and games (Q1101091) (← links)
- Prefix search with a lie (Q1102755) (← links)
- Detecting errors in searching games (Q1119495) (← links)
- Ulam's searching game with lies (Q1121815) (← links)
- Coping with errors in binary search procedures (Q1144379) (← links)
- Social processes and proofs of theorems and programs (Q1150266) (← 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)
- On sorting in the presence of erroneous information (Q1199884) (← links)
- Logic of infinite quantum systems (Q1325668) (← 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)
- From the Fermi-Pasta-Ulam model to higher-order nonlinear evolution equations (Q1690102) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- When \textit{I cut, you choose} method implies intransitivity (Q1783143) (← 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)
- Hypothesis test for causal explanations in human pathology: Evaluation of pulmonary edema in 181 autopsied patients with leukemia (Q1836258) (← 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)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
