Solution of Ulam's problem on searching with a lie
Journal of Combinatorial Theory Series A
Combinatorial search
Detecting errors in searching games
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
Data networks (2nd ed.)
Ulam's searching game with a fixed number of lies
Theoretical Computer Science
On playing “Twenty Questions” with a liar
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Monotonicity and efficient computation of optimal dichotomous search
Discrete Applied Mathematics
Designing broadcasting algorithms in the Postal Model for message-passing systems
Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Journal of Combinatorial Theory Series A
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Playing twenty questions with a procrastinator
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal strategies against a liar
Theoretical Computer Science
Optimal point-to-point broadcast algorithms via lopsided trees
Discrete Applied Mathematics
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Delayed Information and Action in On-line Algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Search with noisy and delayed responses
General Theory of Information Transfer and Combinatorics
A kraft–type inequality for d–delay binary search codes
General Theory of Information Transfer and Combinatorics
| Hi-index | 0.00 |
How many questions are necessary to guess an unknown number x in the set S = {1, 2, ..., n}, by using only comparison questions, that is questions of the type "Is x ≤ a?", when answers are received with a constant delay d, and up to a constant number c of the answers can be lost, i.e. can be not received at all? We exactly solve this problem for all integers d ≥ 0 and c = 1. We also briefly discuss the analogy between the above problem and that of broadcasting over a fully connected network with link latency.