On the complexity of function learning
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
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
Least adaptive optimal search with unreliable tests
Theoretical Computer Science
Playing by searching: two strategies against a linearly bounded liar
Theoretical Computer Science
Least Adaptive Optimal Search with Unreliable Tests
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
coping with Delays and Time-Outs in Binary Search Procedures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Journal of Combinatorial Theory Series A
Strategies for the Renyi-Ulam game with fixed number of lies
Theoretical Computer Science
Theoretical Computer Science - Algorithmic combinatorial game theory
The Rényi-Ulam pathological liar game with a fixed number of lies
Journal of Combinatorial Theory Series A
Q-ary search with one lie and bi-interval queries
Information Processing Letters
Noisy binary search and its applications
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Question/Answer Games on Towers and Pyramids
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Learning with Continuous Experts Using Drifting Games
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Complexity of question/answer games
Theoretical Computer Science
Two cooperative versions of the Guessing Secrets problem
Information Sciences: an International Journal
On error correction with feedback under list decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Improving the sphere-packing bound for binary codes over memoryless symmetric channels
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Learning with continuous experts using drifting games
Theoretical Computer Science
Q-Ary ulam-renyi game with constrained lies
General Theory of Information Transfer and Combinatorics
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The multi-interval ulam-rényi game
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Hi-index | 5.23 |