메뉴 건너뛰기




Volumn 314, Issue 1-2, 2004, Pages 45-55

Strategies for the Renyi-Ulam Game with fixed number of lies

Author keywords

Renyi Ulam Game; Searching with lies

Indexed keywords

COMPUTATIONAL METHODS; GAME THEORY; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

EID: 0842265042     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.036     Document Type: Article
Times cited : (6)

References (13)
  • 3
    • 0001905415 scopus 로고
    • Block coding for the binary symmetric channel with noiseless, delayless feedback
    • H.B. Mann. New York: Wiley
    • Berlekamp E.R. Block coding for the binary symmetric channel with noiseless, delayless feedback. Mann H.B. Error Correcting Codes. 1968;61-85 Wiley, New York.
    • (1968) Error Correcting Codes , pp. 61-85
    • Berlekamp, E.R.1
  • 4
    • 0037028452 scopus 로고    scopus 로고
    • Least adaptive optimal search with unreliable tests
    • Cicalese F., Mundici D., Vaccaro U. Least adaptive optimal search with unreliable tests. Theoret. Comput. Sci. 270:2002;877-893.
    • (2002) Theoret. Comput. Sci. , vol.270 , pp. 877-893
    • Cicalese, F.1    Mundici, D.2    Vaccaro, U.3
  • 5
    • 0006936431 scopus 로고    scopus 로고
    • Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
    • Deppe C. Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes. Discrete Math. 224(1-3):2000;79-98.
    • (2000) Discrete Math. , vol.224 , Issue.1-3 , pp. 79-98
    • Deppe, C.1
  • 6
    • 0842305358 scopus 로고    scopus 로고
    • Searching with lies and coding with feedback
    • Information Theory in Mathematics, Series of Bolyai Studies, Springer, Berlin, to be published
    • C. Deppe, Searching with lies and coding with feedback, in: Search and Communication Complexity, Information Theory in Mathematics, Series of Bolyai Studies, Springer, Berlin, to be published.
    • Search and Communication Complexity
    • Deppe, C.1
  • 7
    • 0141982764 scopus 로고
    • Ulam's searching game with two lies
    • Guzicki W. Ulam's searching game with two lies. J. Combin. Theory Ser. A. 54:1990;1-19.
    • (1990) J. Combin. Theory Ser. A , vol.54 , pp. 1-19
    • Guzicki, W.1
  • 8
    • 0002222213 scopus 로고
    • Searching with lies
    • P. Rowlinson (Ed.), Surveys in Combinatorics, Cambridge Univ. Press, Cambridge
    • R. Hill, Searching with lies, in: P. Rowlinson (Ed.), Surveys in Combinatorics, Lecture Note Series, Vol. 218, Cambridge Univ. Press, Cambridge, 1995, pp. 41-70.
    • (1995) Lecture Note Series , vol.218 , pp. 41-70
    • Hill, R.1
  • 9
    • 0001567919 scopus 로고
    • Solution of Ulam's problem on searching with a lie
    • Pelc A. Solution of Ulam's problem on searching with a lie. J. Combin. Theory Ser. A. 44:1987;129-140.
    • (1987) J. Combin. Theory Ser. A , vol.44 , pp. 129-140
    • Pelc, A.1
  • 10
    • 0037028458 scopus 로고    scopus 로고
    • Searching games with errors - Fifty years of coping with liars
    • Pelc A. Searching games with errors - fifty years of coping with liars. Theoret. Comput. Sci. 270:2002;71-109.
    • (2002) Theoret. Comput. Sci. , vol.270 , pp. 71-109
    • Pelc, A.1
  • 11
    • 0000369170 scopus 로고
    • On a problem of information theory
    • Rényi A. On a problem of information theory. MTA Mat. Kut. Int. Kozl. 6B:1961;505-516.
    • (1961) MTA Mat. Kut. Int. Kozl. , vol.6 B , pp. 505-516
    • Rényi, A.1
  • 12
    • 0026839843 scopus 로고
    • Ulam's searching game with a fixed number of lies
    • Spencer J. Ulam's searching game with a fixed number of lies. Theoret. Comput. Sci. 95:1992;307-321.
    • (1992) Theoret. Comput. Sci. , vol.95 , pp. 307-321
    • Spencer, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.