Group Testing with Unreliable Tests

Information Sciences

Volumn 96, Issue 1-2, 1997, Pages 1-14

  De Bonis, Annalisa ^a   Gargano, Luisa ^b   Vaccaro, Ugo ^b  

^a Princeton University   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FEEDBACK; INFORMATION SCIENCE; MATHEMATICAL TECHNIQUES; QUERY LANGUAGES; TESTING;

UNRELIABLE TESTS;

COMPUTER SCIENCE;

EID: 0030736946     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(96)00155-7     Document Type: Article

References (25)

1. J. A. Aslam and A. Dhagat, Searching in the presence of linearly bounded errors, in: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, 1991, pp. 486-493.
2. M. Aigner, Combinatorial Search, Wiley-Teubner, New York, Stuttgart, 1988.
3. X. M. Chang, F. K. Hwang, and J. F. Weng, Optimal detection of two defectives with a parity check device, SIAM J. Disc. Math. 1:38-44 (1988).
4. J. Czyzowicz, K. B. Lakshmanan, and A. Pelc, Searching with a forbidden lie pattern in responses, Inf. Process. Lett. 37:127-132 (1991).
5. J. Czyzowicz, D. Mundici, and A. Pelc, Solution of Ulam's problem on binary search with two lies, J. Combin. Theory Ser. A 49:384-388 (1988).
6. J. Czyzowicz, D. Mundici, and A. Pelc, Ulam's searching game with lies, J. Combin. Theory Ser. A 50:62-76 (1989).
7. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, World Scientific, Singapore, 1993.
8. L. Gargano, J. Körner, and U. Vaccaro, Search problems for two irregular coins with incomplete feedback: The Underweight model, Discr. Appl. Math. 36:191-197 (1992).
9. L. Gargano, V. Montuori, G. Setaro, and U. Vaccaro, An improved algorithm for quantitative group testing, Discr. Appl. Math. 36:299-306 (1992).
10. W. Guzicki, Ulam's searching game with two lies, J. Combin. Theory Ser. A 54 (1990).
11. G. Chang, F. K. Hwang, and S. Lin, Group testing with two defectives, Discr. Appl. Math. 4:97-102 (1982).
12. F. K. Hwang, A tale of two coins, Am. Math. Monthly 94:121-129 (1987).
13. F. K. Hwang, Updating a tale of two coins, in Graph Theory and Its Applications: East and West, The Annals of the New York Academy of Sciences, 1989, Vol. 576, pp. 259-265.
14. G. O. H. Katona, Combinatorial search problems, in: J. N. Srivastava et al. (Eds.), A Survey of Combinatorial Theory, North-Holland, Amsterdam, 1973, pp. 285-309.
15. A. Negro and M. Sereno, Solution of Ulam's problem on binary search with three lies, J. Combin. Theory Ser. A 59:149-154 (1992).
16. A. Negro and M. Sereno, An Ulam's searching game with three lies, Adv. Math., to appear.
17. A. Pelc, Solution of Ulam's problem on searching with a lie, J. Combin. Theory Ser. A 44:129-140 (1987).
18. A. Pelc, Prefix search with a lie, J. Combin. Theory Ser. A 48:165-173 (1988).
19. A. Pelc, Detecting errors in searching games, J. Combin. Theory Ser. A 51:43-54 (1989).
20. A. Pelc, Searching with known error probability, Theoret. Comput. Sci. 63:185-202 (1989).
21. B. Ravikumar and K. B. Lakshmanan, Coping with known patterns of lies in a search game, Theoret. Comput. Sci. 33:85-94 (1984).
22. B. Ravikumar, K. Ganesan, and K. B. Lakshmanan, On selecting the largest element in spite of erroneous information, in Proceedings of ICALP '87, pp. 88-99.
23. R. L. Rivest, A. R. Meyer, D. J. Kleitman, K. Winklemann, and J. Spencer, Coping with errors in binary search procedures, J. Comput. Syst. Sci. 20:396-406 (1980).
24. J. Spencer, Ulam's searching games with a fixed number of lies, Theoret. Comput. Sci. 95:307-321 (1992).
25. J. K. Wolf, Born again group testing: Multiaccess communications, IEEE Trans. Inf. Theory IT-31:185-191 (1985).