1. Abe, N., & Warmuth, M. (1990). On the computational complexity of approximating distributions by probabilistic automata. Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 52–66), Rochester, NY: Morgan Kaufmann.
2. Barron, A.R.(1985). Logically smooth density estimation, PH.D. dissertation, Dept. of Electrical Eng., of Stanford Univ.
3. Barron, A.R.(1989). Statistical properties of artificial neural networks. Proceedings of the 28th Conference on Decision and Control, 280–285, Tampa. Florida.
4. Minimum complexity density Estimation;Barron;IEEE Trans, on IT,1989
5. Desantis, A., Markowsky, G., & Wegman, M.N.(1988). Learning probabilistic prediction functions. Proceedings of the First Annual Workshop on Computational Learning Theory, (pp. 312–328), Cambrigde, MA: Morgan Kaufmann.