Journal of Combinatorial Theory Series A
Searching with known error probability
Theoretical Computer Science
Detecting errors in searching games
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
Coping with Erroneous Information While Sorting
IEEE Transactions on Computers
On playing “Twenty Questions” with a liar
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Playing the matching-shoulders lob-pass game with logarithmic regret
COLT '94 Proceedings of the seventh 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
A Fault-Tolerant Merge Sorting Algorithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
The price of resiliency: a case study on sorting with memory faults
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Noisy binary search and its applications
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Sorting and Selection with Imprecise Comparisons
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Optimal resilient sorting and searching in the presence of memory faults
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Optimal resilient dynamic dictionaries
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Designing reliable algorithms in unreliable memories
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Experimental study of resilient algorithms and data structures
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Data structures resilient to memory faults: an experimental study of dictionaries
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Optimal resilient sorting and searching in the presence of memory faults
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
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
Priority queues resilient to memory faults
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Hi-index | 0.00 |