Christian Deppe Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:224, n:1-3, pp:79-98 [Journal]
Christian Deppe Strategies for the Renyi-Ulam Game with fixed number of lies. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:314, n:1-2, pp:45-55 [Journal]
Non--binary error correcting codes with noiseless feedback, localized errors, or both. [Citation Graph (, )][DBLP]
Searching with lies under error cost constraints. [Citation Graph (, )][DBLP]