On selecting the largest element in spite of erroneous information
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Searching in the presence of linearly bounded errors
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Comparison-based search in the presence of errors
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An O(nlogn)-size fault-tolerant sorting network (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for noisy Boolean decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Error-resilient DNA computation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Selection in the presence of noise: the design of playoff systems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On optimal strategies for searching in presence of errors
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Deterministic Majority filters applied to stochastic sorting
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Computing Boolean functions from multiple faulty copies of input bits
Theoretical Computer Science - Latin American theorotical informatics
Self-Stabilizing Microprocessor: Analyzing and Overcoming Soft Errors
IEEE Transactions on Computers
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Noisy sorting without resampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Fast error-tolerant quartet phylogeny algorithms
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
ESA'11 Proceedings of the 19th European conference on Algorithms
Max algorithms in crowdsourcing environments
Proceedings of the 21st international conference on World Wide Web
The Journal of Machine Learning Research
Manipulating stochastically generated single-elimination tournaments for nearly all players
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Fast error-tolerant quartet phylogeny algorithms
Theoretical Computer Science
| Hi-index | 0.00 |