Arpe J and Reischuk R. Learning juntas in the presence of noise. Proceedings of the Third international conference on Theory and Applications of Models of Computation. (387-398).
Bshouty N and Feldman V.
(2002). On using extended statistical queries to avoid membership queries. The Journal of Machine Learning Research. 2. (359-395). Online publication date: 1-Mar-2002.
Bshouty N, Jackson J and Tamon C. Uniform-distribution attribute noise learnability. Proceedings of the twelfth annual conference on Computational learning theory. (75-80).
Gentile C and Helmbold D. Improved lower bounds for learning from noisy examples. Proceedings of the eleventh annual conference on Computational learning theory. (104-115).
Goldman S, Kwek S and Scott S. Learning from examples with unspecified attribute values (extended abstract). Proceedings of the tenth annual conference on Computational learning theory. (231-242).
Frazier M, Goldman S, Mishra N and Pitt L.
(1996). Learning from a Consistently Ignorant Teacher. Journal of Computer and System Sciences. 52:3. (471-492). Online publication date: 1-Jun-1996.
Decatur S and Gennaro R. On learning from noisy and incomplete examples. Proceedings of the eighth annual conference on Computational learning theory. (353-360).
Blum A, Chalasani P, Goldman S and Slonim D. Learning with unreliable boundary queries. Proceedings of the eighth annual conference on Computational learning theory. (98-107).
Goldman S and Sloan R.
(1995). Can PAC learning algorithms tolerate random attribute noise?. Algorithmica. 14:1. (70-84). Online publication date: 1-Jul-1995.
Frazier M, Goldman S, Mishra N and Pitt L. Learning from a consistently ignorant teacher. Proceedings of the seventh annual conference on Computational learning theory. (328-339).
Ron D and Rubinfeld R. Learning fallible finite state automata. Proceedings of the sixth annual conference on Computational learning theory. (218-227).