| [1] Richard Bellman. Dynamic Programming. Princeton: Princeton University Press, 1957
[2] Berlekamp E R. Cooperative bridge bidding. IEEE Transactions On Information Theory, 1976, 22: 753--755
[3] Du D, Hwang F. Minimizing a combinatorial function. SIAM J Algebraic Discrete Methods, 1982, 3: 523--528
[4] Hu M, Hwang F, Wang J. A boundary problem for group testing. SIAM J Algebraic Discrete Methods, 1982, 2: 81--87
[5] Mead D G. The average number of weighings to locate a counterfeit coin. IEEE Transactions On Information Theory, 1979, 25: 616--617
[6] Fano R M. Transmission of Information. New York: Wiley, 1961
[7] Wang Q Y, Lin Y X, Gulati C M. The invariance principle for linear processes with applications. Econometric Theory, 2002, 18: 119--139
[8] Bellman R, Glass B. On varsions of the defective coin problem. Information and Control, 1961, 4: 118--151
[9] Ratko To\u{s}i'c. Two counterfeit coins. Discrete Mathematics, 1983, 45: 295--298
[10] Hwang F. A tale of two coins. American Mathematical Monthly, 1987, 94: 121--129
[11] Rato To\u{s}i\'{e}. Three counterfeit coins. Review and Research, Faculty of Sciences, University of Novi Sad, 1985, 15: 224--233
[12] Rato To\u{s}i\'{e}. Four counterfeit coins. Review and Research, Faculty of Sciences, University of Novi Sad, 1984, 14: 99--108
[13] Rato To\u{s}i\'{e}. Five counterfeit coins. J Statit Plann Inference, 1989, 22: 197--202
[14] Stewart S. Cairns, balance scale sorting. American Mathematical Monthly, 1963, 70: 136--148
[15] Ivica Bosnjak. Some results concerning three counterfeit coins problem. Discrete Applied Mathematics, 1994, 48: 81--85
|