We consider the problem of locating two unknown elements x; y using group testing devices. Assuming that up to a given number E of tests out of Q can give erroneous feedback, we provide optimal algorithms to search for x and y.
|
33
|
Coping with errors in binary search procedures
– Kleitman, Meyer, et al.
- 1978
|
|
20
|
Searching in the presence of linearly bounded errors, STOC
– Aslam, Dhagat
|
|
18
|
Solution of Ulam’s problem on searching with a lie
– Pelc
- 1987
|
|
14
|
Ulam's searching game with two lies
– Guzicki
- 1990
|
|
8
|
Ulam's searching game with lies
– Czyzowicz, Mundici, et al.
- 1989
|
|
5
|
A Tale of Two Coins
– Hwang
- 1987
|
|
5
|
On selecting the largest element in spite of erroneous information
– Ravikumar, Ganesan, et al.
- 1987
|
|
4
|
Solution of Ulam's problem on binary search with two lies
– Czyzowicz, Mundici, et al.
- 1988
|
|
4
|
Solution of Ulam's problem on binary search with three lies
– Negro, Sereno
- 1992
|
|
4
|
Detecting errors in searching games
– Pelc
- 1989
|
|
3
|
Optimal Detection of two Defectives with a Parity Check Device
– Chang, Hwang, et al.
- 1988
|
|
3
|
An Improved Algorithm for Quantitative Group Testing
– Gargano, Montuori, et al.
- 1992
|
|
3
|
An Ulam's searching game with three lies
– Negro, Sereno
|
|
3
|
Coping with known patterns of lies in a search game
– Ravikumar, Lakshmanan
- 1984
|
|
2
|
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Model
– Gargano, Korner, et al.
- 1992
|
|
2
|
Combinatorial Search Problems", in: A Survey of Combinatorial Theory
– Katona
- 1973
|
|
2
|
Pre search with a lie
– Pelc
- 1988
|
|
1
|
Searching with a forbidden lie pattern in responses
– Czyzowicz, Lakshmanan, et al.
- 1991
|
|
1
|
Group Testing with Two Defectives", Discrete Applied Mathematics 4
– Chang, Hwang, et al.
- 1982
|
|
1
|
Updating a tale of two coins, in: Graph Theory and its Applications
– Hwang
- 1989
|
|
1
|
Searching with known error probability", Theoretical Computer Science 63
– Pelc
- 1989
|
|
1
|
Ulam's searching games with a fixed number of lies", Theoretical Computer Science 95
– Spencer
- 1992
|
|
1
|
Born again Group testing: Multiacces communications
– Wolf
- 1985
|
|
