Solution of Ulam's problem on searching with a lie
Journal of Combinatorial Theory Series A
Journal of Combinatorial Theory Series A
Searching with known error probability
Theoretical Computer Science
Ulam's searching game with two lies
Journal of Combinatorial Theory Series A
Searching in the presence of linearly bounded errors
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Ulam's searching game with a fixed number of lies
Theoretical Computer Science
Solution of Ulam's problem on binary search with three lies
Journal of Combinatorial Theory Series A
On playing “Twenty Questions” with a liar
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Comparison-based search in the presence of errors
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computing with Noisy Information
SIAM Journal on Computing
Optimal comparison strategies in Ulam's searching game with two errors
Theoretical Computer Science
On optimal strategies for searching in presence of errors
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
The multi-interval ulam-rényi game
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 5.23 |
Computability and complexity are the two major lines along which the science of algorithms has evolved; but the same concepts guide many human activities. We try to catch some glimpses of the connections between these two worlds, to meet the expectations ...