TY - JOUR
T1 - Computing with noisy information
AU - Feige, Uriel
AU - Raghavan, Prabhakar
AU - Peleg, David
AU - Upfal, Eli
PY - 1994
Y1 - 1994
N2 - This paper studies the depth of noisy decision trees in which each node gives the wrong answer with some constant probability. In the noisy Boolean decision tree model, tight bounds are given on the number of queries to input variables required to compute threshold functions, the parity function and symmetric functions. In the noisy comparison tree model, tight bounds are given on the number of noisy comparisons for searching, sorting, selection and merging. The paper also studies parallel selection and sorting with noisy comparisons, giving tight bounds for several problems.
AB - This paper studies the depth of noisy decision trees in which each node gives the wrong answer with some constant probability. In the noisy Boolean decision tree model, tight bounds are given on the number of queries to input variables required to compute threshold functions, the parity function and symmetric functions. In the noisy comparison tree model, tight bounds are given on the number of noisy comparisons for searching, sorting, selection and merging. The paper also studies parallel selection and sorting with noisy comparisons, giving tight bounds for several problems.
UR - http://www.scopus.com/inward/record.url?scp=0028516898&partnerID=8YFLogxK
U2 - 10.1137/S0097539791195877
DO - 10.1137/S0097539791195877
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0028516898
SN - 0097-5397
VL - 23
SP - 1001
EP - 1018
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 5
ER -