scientific article; zbMATH DE number 3205803
From MaRDI portal
Publication:5331663
zbMath0126.35605MaRDI QIDQ5331663
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Coding with noiseless feedback ⋮ Strategies for the Renyi--Ulam game with fixed number of lies ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Identifying defective sets using queries of small size ⋮ Correcting a single error in feedback channels ⋮ External-memory sorting with comparison errors ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Binary search in graphs revisited ⋮ Searching with lies under error cost constraints ⋮ Superimposed Codes and Threshold Group Testing ⋮ Search When the Lie Depends on the Target ⋮ How to play the majority game with a liar ⋮ Unnamed Item ⋮ 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 ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice ⋮ Separable collusion-secure multimedia codes ⋮ Two-batch liar games on a general bounded channel ⋮ Binary Search in Graphs Revisited ⋮ The Rényi-Ulam pathological liar game with a fixed number of lies ⋮ On the theory of random search ⋮ Searching with lies under error transition cost constraints ⋮ Q-ary Ulam-Rényi game with constrained lies ⋮ The Interval Liar Game ⋮ An efficient noisy binary search in graphs via Median approximation ⋮ The power of adaptivity in source identification with time queries on the path
This page was built for publication:
