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	Dana Angluin , William I. Gasarch , Carl H. Smith, Training sequences, Theoretical Computer Science, v.66 n.3, p.255-272, 26 Aug. 1989  [doi>10.1016/0304-3975(89)90153-9]
	2	K. Bartlmae, S. Gutjahr, and G. Na.khaeizadeh. Incorporating prior knowledge about financial markets through neural multitask learning. In Proceedings of the Fifth International Conference on Neural Networks in the Capital Markets, 1997.
	3	J. Barzdin. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Latvian State University, Riga, 210:82-88, 1974.
	4	Jonathan Baxter, A Bayesian/Information Theoretic Model of Learning to Learn viaMultiple Task Sampling, Machine Learning, v.28 n.1, p.7-39, July 1997  [doi>10.1023/A:1007327622663]
	5	L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125 155, 1975.
	6	R. A. Caruana. Multitask connectionist learning. In Proceedings of the 1993 Connectioni.st Models Summer School, pages 372 379, 1993.
	7	R. A. Caruana. Algorithms and applications for multitask learning. In Proceedings 13th International Conference on Machine Learning, pages 87- 95. Morgan Kaufmann, 1996.
	8	J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193 220, 1983.
	9	Thomas G. Dietterich , Hermann Hild , Ghulum Bakiri, A Comparison of ID3 and Backpropagation for English Text-To-Speech Mapping, Machine Learning, v.18 n.1, p.51-80, Jan. 1995  [doi>10.1023/A:1022822623726]
	10	L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kmnmer, S. Kurtz, M. Pleszkoeh, T. Slaman, R. Solovay, and F. Stephan. Extremes in the degrees of inferability. Annals of Pure and Applied Logic, 66:21-276, 1994.
	11	R. V. Freivalds and R. Wiehagen. Inductive inference with additional information. Elekt~vnisehe Informationsverarbeitung und Nybernetik, 15:179 185, 1979.
	12	M. Fulk. Robust separations in inductive inference. In Proceedings of the 31st Annual Symposium on lYbundations of Computer Science, pages 405-410, St. Louis, Missouri, 1990.
	13	Sanjay Jain , Arun Sharma, Learning with the knowledge of an upper bound on program size, Information and Computation, v.102 n.1, p.118-166, Jan. 1993  [doi>10.1006/inco.1993.1005]
	14	Sanjay Jain , Carl Smith , Rolf Wiehagen, On the power of learning robustly, Proceedings of the eleventh annual conference on Computational learning theory, p.187-197, July 24-26, 1998, Madison, Wisconsin, United States  [doi>10.1145/279943.279982]
	15	Efim Kinber , Carl H. Smith , Mahendran Velauthapillai , Rolf Wiehagen, On learning multiple concepts in parallel, Proceedings of the sixth annual conference on Computational learning theory, p.175-181, July 26-28, 1993, Santa Cruz, California, United States  [doi>10.1145/168304.168328]
	16	E. Kinber and R. Wiehagen. Parallel learning - a recursion-theoretic approach. Informatik- Preprint 10, Fachbereich Informatik, Humbold- Universit~t, 1991.
	17	Martin Kummer , Frank Stephan, Inclusion problems in parallel learning and games, Journal of Computer and System Sciences, v.52 n.3, p.403-420, June 1996  [doi>10.1006/jcss.1996.0031]
	18	Martin Kummer , Frank Stephan, On the structure of degrees of inferability, Journal of Computer and System Sciences, v.52 n.2, p.214-238, April 1996  [doi>10.1006/jcss.1996.0018]
	19	S. Mat, win and M. Kubat. The role of context in concept learning. In M. Kubat and G. Widmer, editors, Proceedings of the ICML-96 Pre-Coufcrenc~~ Workshop on Learning in Context-Sensitiv6 Domains, Bari, Italy, pages l 5, 1996.
	20	Tom M. Mitchell , Rich Caruana , Dayne Freitag , John McDermott , David Zabowski, Experience with a learning personal assistant, Communications of the ACM, v.37 n.7, p.80-91, July 1994  [doi>10.1145/176789.176798]
	21	P. Odiffeddi. Classical flecursion Theory. North- Holland, Amsterdam, 1989.
	22	D. Osherson, M. Stob, and S. Weinstein. 3'ystems that Learn. M{T Press, Cambridge, Massachusetts, 1986.
	23	L. Pratt, J. Mostow, and C. Kamm. Direct transfer of learned information among neural networks. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91), 1991.
	24	H. Rogers. Gbdel numberings of partial recursive functions. Journal of Symbolic Logic, 23:331 341, 1958.
	25	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	26	James S. Royer, A connotational theory of program structure, Springer-Verlag New York, Inc., New York, NY, 1987
	27	T. J. Sejnowski and C. Rosenberg. NETtalk: A parallel network that learns to read aloud. Technical Report JHU-EECS-86-01, Johns Hopkins University, 1986.

• 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