Balancing vectors in the max norm
Combinatorica
On selecting the largest element in spite of erroneous information
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Solution of Ulam's problem on searching with a lie
Journal of Combinatorial Theory Series A
Learning in the presence of malicious errors
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Searching with known error probability
Theoretical Computer Science
Ulam's searching game with lies
Journal of Combinatorial Theory Series A
Computing with unreliable information
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
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
SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE
SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE
Lower bounds for identifying subset members with subset queries
Proceedings of the sixth 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
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Optimal resilient sorting and searching in the presence of memory faults
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Designing reliable algorithms in unreliable memories
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Q-Ary ulam-renyi game with constrained lies
General Theory of Information Transfer and Combinatorics
Resilient algorithms and data structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Designing reliable algorithms in unreliable memories
Computer Science Review
| Hi-index | 0.00 |