AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown integer between 1 and 1000000 if at most three of the answers may be erroneous
AbstractWe investigate the problem of finding an unknown leaf in a full binary tree, allowing the qu...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
The Ulam-Rényi game is a classical model for the problem of finding an unknown number in a finite se...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
AbstractUlam's problem is to determine the minimal number of yes-no queries sufficient to find an un...
AbstractIn this paper we determine the minimal number of yes–no queries that are needed to find an u...
In this paper we determine the minimal number of yes-no queries needed to find an unknown integer be...
AbstractSomeone thinks of a number between one and one million (which is just less than 220). Anothe...
AbstractWe consider the problem of finding the minimal number Ll(M) of binary questions needed to fi...
AbstractWe determine the minimal number of yes-no queries sufficient to find an unknown integer betw...
AbstractWe consider the following scenario: There are two individuals, say Q (Questioner) and R (Res...
AbstractLetft(n) be the number of questions necessary to find an unknown element out of a set ofnele...
The following model is considered. There is exactly one unknown element in the n-element set. A ques...
Deppe C. Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE....
AbstractWe investigate the problem of finding an unknown leaf in a full binary tree, allowing the qu...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
The Ulam-Rényi game is a classical model for the problem of finding an unknown number in a finite se...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
AbstractIn this paper we determine the minimal number of yes-no queries needed to find an unknown in...
AbstractUlam's problem is to determine the minimal number of yes-no queries sufficient to find an un...
AbstractIn this paper we determine the minimal number of yes–no queries that are needed to find an u...
In this paper we determine the minimal number of yes-no queries needed to find an unknown integer be...
AbstractSomeone thinks of a number between one and one million (which is just less than 220). Anothe...
AbstractWe consider the problem of finding the minimal number Ll(M) of binary questions needed to fi...
AbstractWe determine the minimal number of yes-no queries sufficient to find an unknown integer betw...
AbstractWe consider the following scenario: There are two individuals, say Q (Questioner) and R (Res...
AbstractLetft(n) be the number of questions necessary to find an unknown element out of a set ofnele...
The following model is considered. There is exactly one unknown element in the n-element set. A ques...
Deppe C. Strategies for the Renyi-Ulam Game with fixed number of lies. THEORETICAL COMPUTER SCIENCE....
AbstractWe investigate the problem of finding an unknown leaf in a full binary tree, allowing the qu...
AbstractSuppose x is an n-bit integer. By a comparison question we mean a question of the form “does...
The Ulam-Rényi game is a classical model for the problem of finding an unknown number in a finite se...
DOI
Add to ORKG