Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A.R. Barron. Complexity regularization with application to artificial neural networks. In G. Roussas, editor, Nonparametric Functional Estimation and Related Topics, pages 561-576. Kluwer Academic Publishers, 1991.
	2	A.R. Barron and T.M. Cover. Minimum complexity density estimation. IEEE ~ransactions on Information Theory, 37:1034-1054, 1991.
	3	Wray Buntine. Learning classification trees. Statistics and Computing, 2:63-73, 1992.
	4	David P. Helmbold , Robert E. Schapire, Predicting Nearly As Well As the Best Pruning of a Decision Tree, Machine Learning, v.27 n.1, p.51-68, April 1997  [doi>10.1023/A:1007396710653]
	5	Michael J. Kearns , Yishay Mansour, A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization, Proceedings of the Fifteenth International Conference on Machine Learning, p.269-277, July 24-27, 1998
	6	Michael Kearns , Yishay Mansour , Andrew Y. Ng , Dana Ron, An experimental and theoretical comparison of model selection methods, Proceedings of the eighth annual conference on Computational learning theory, p.21-30, July 05-08, 1995, Santa Cruz, California, United States  [doi>10.1145/225298.225301]
	7	G. Lugosi and K. Zeger. Concept learning using complexity regularization. IEEE 2~ansactions on Information Theory, 42:48-54, 1996.
	8	David A. McAllester, Some PAC-Bayesian theorems, Proceedings of the eleventh annual conference on Computational learning theory, p.230-234, July 24-26, 1998, Madison, Wisconsin, United States  [doi>10.1145/279943.279989]
	9	Jonathan J. Oliver and David Hand. On pruning and averaging decision trees. In Proceedings of the Twelfth International Conference on Machine Learning, 1995.
	10	Fernando Pereira , Yoram Singer, An efficient extension to mixture techniques for prediction and decision trees, Proceedings of the tenth annual conference on Computational learning theory, p.114-121, July 06-09, 1997, Nashville, Tennessee, United States  [doi>10.1145/267460.267487]
	11	J. Ross Quinlan, C4.5: programs for machine learning, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1993
	12	John Shawe-Taylor , Robert C. Williamson, A PAC analysis of a Bayesian estimator, Proceedings of the tenth annual conference on Computational learning theory, p.2-9, July 06-09, 1997, Nashville, Tennessee, United States  [doi>10.1145/267460.267466]

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski