TY - GEN

T1 - Computing with unreliable information

AU - Feige, Uriel

AU - Peleg, David

AU - Raghavan, Prabhakar

AU - Upfal, Eli

PY - 1990

Y1 - 1990

N2 - A (possibly randomized) computation tree is considered in which each node gives the correct answer with some probability ≥ p, where p is a fixed constant in ( 1/2 , 1), bounded away from 1/2 and 1. The node faults are independent. The depth of the computation tree is studied in terms of a tolerance parameter Q member of (0, 1/2 ): on any instance, the computation tree leads to a leaf giving the correct answer on that instance with probability at least 1 - Q. The success probability of the algorithm is computed over the combined probability space of the outcome of individual comparisons and the results of coinflips (in case our algorithm is randomized). Noisy comparison trees are studied for problems such as sorting, selection and searching.

AB - A (possibly randomized) computation tree is considered in which each node gives the correct answer with some probability ≥ p, where p is a fixed constant in ( 1/2 , 1), bounded away from 1/2 and 1. The node faults are independent. The depth of the computation tree is studied in terms of a tolerance parameter Q member of (0, 1/2 ): on any instance, the computation tree leads to a leaf giving the correct answer on that instance with probability at least 1 - Q. The success probability of the algorithm is computed over the combined probability space of the outcome of individual comparisons and the results of coinflips (in case our algorithm is randomized). Noisy comparison trees are studied for problems such as sorting, selection and searching.

UR - http://www.scopus.com/inward/record.url?scp=0025065888&partnerID=8YFLogxK

U2 - 10.1145/100216.100230

DO - 10.1145/100216.100230

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0025065888

SN - 0897913612

SN - 9780897913614

T3 - Proc 22nd Annu ACM Symp Theory Comput

SP - 128

EP - 137

BT - Proc 22nd Annu ACM Symp Theory Comput

PB - Publ by ACM

T2 - Proceedings of the 22nd Annual ACM Symposium on Theory of Computing

Y2 - 14 May 1990 through 16 May 1990

ER -