1. D. Angluin, D. Slonim, “Learning monotone DNF formula with an incomplete membership oracle”, Proc of the 4th Annual Workshop on Computational Learning Theory, pages 139–146. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1991.
2. A. Blum, S. Rudich, “Fast learning of k-term DNF formulas with queries”, Proc of the 24th Annual ACM Symposium on Theory of Computing, May 1992, pages 382–389.
3. A. Blum, P. Chalasani, J. Jackson, “On learning embedded symmetric concepts” Proc of the Sixth Annual ACM Conference on Computational Learning Theory, pages 337–346.
4. S. Goldman, H. Mathias, “Learning k-term DNF formulas with an incomplete membership oracle”, Proc of the 5th Annual Workshop on Computational Learning Theory, pages 72–77, Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1992.
5. J. Naor, M. Naor, “Small-bias probability space: efficient constructions and applications”, Proc of the 22th Annual ACM Symposium on Theory of Computing, May 1992, pages 213–223.