scientific article; zbMATH DE number 3282350
From MaRDI portal
Publication:5568914
zbMath0176.49404MaRDI QIDQ5568914
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Strategies for the Renyi--Ulam game with fixed number of lies ⋮ A halfliar's game ⋮ Binary search with errors and variable cost queries ⋮ Solution of Ulam's problem on searching with a lie ⋮ Ulam's searching game with lies ⋮ Reliable minimum finding comparator networks ⋮ Optimal comparison strategies in Ulam's searching game with two errors ⋮ On the Rényi-Ulam game with restricted size queries ⋮ The halflie problem. ⋮ Coping with errors in binary search procedures ⋮ \(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ Correcting a single error in feedback channels ⋮ Linear-code multicast on parallel architectures ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Algorithms for \(q\)-ary error-correcting codes with limited magnitude and feedback ⋮ Bounds for the capacity error function for unidirectional channels with noiseless feedback ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Conditioning a state by a Łukasiewicz event: a probabilistic approach to Ulam games ⋮ Optimal strategies against a liar ⋮ Solution of Ulam's problem on binary search with three lies ⋮ An algorithm for ``Ulam's Game and its application to error correcting codes ⋮ Searching with lies under error cost constraints ⋮ The Rényi-Ulam games and many-valued logics ⋮ A simple solution to Ulam's liar game with one lie ⋮ Searching with lies: The Ulam problem ⋮ On using noisy feedback in a Gaussian channel ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Least adaptive optimal search with unreliable tests ⋮ How to play the one-lie Rényi-Ulam game ⋮ Ulam's searching game with three lies ⋮ Ulam's searching game with two lies ⋮ Two-batch liar games on a general bounded channel ⋮ Perfect two-fault tolerant search with minimum adaptiveness ⋮ The Rényi-Ulam pathological liar game with a fixed number of lies ⋮ Coping with known patterns of lies in a search game ⋮ Searching with lies under error transition cost constraints ⋮ Q-ary Ulam-Rényi game with constrained lies ⋮ Playing by searching: Two strategies against a linearly bounded liar ⋮ An improved heuristic for the ``Ulam-Rényi game
This page was built for publication:
