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.

	AMS+92	S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara, and A. Yamamoto. Algorithmic learning theory with elementary formal systems. IEICE Trans. Inf. and Syst., E75-D No. 4:405-414, 1992.
	Ang80	D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sczences, 21:46-62, 1980.
	Ari70	S. Arikawa. Elementary formal systems and formal languages--simple formal systems. Memozrs of the Faculty of Sczence, {i'yushu Unwerszty Seties A, 24:47-75, 1970.
	Ari89	H. Arimura. Completeness of depthbounded resolution in logic programming. In Proceedings of the 6th Conference, Japan Soc. Software Scz. Tech., pages 61-64, 1989.
	ASMS91	Setsuo Arikawa , Takeshi Shinohara , Satoru Miyano , Ayumi Shinohara, More About Learning Elementary Formal Systems, Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic, p.107-117, December 02-06, 1991
	ASY92	Setsuo Arikawa , Takeshi Shinohara , Akihiro Yamamoto, Learning elementary formal systems, Theoretical Computer Science, v.95 n.1, p.97-113, March 23, 1992  [doi>10.1016/0304-3975(92)90068-Q]
	Blu67	Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions, Journal of the ACM (JACM), v.14 n.2, p.322-336, April 1967  [doi>10.1145/321386.321395]
	CJS95	John Case , Mandayam Suraj , Sanjay Jain, Not-So-Nearly-Minimal-Size Program Inference, Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, p.76-95, January 1995
	FKS95	Rusins Freivalds , Efim B. Kinber , Carl H. Smith, On the intrinsic complexity of learning, Proceedings of the Second European Conference on Computational Learning Theory, p.154-168, March 13-15, 1995
	FS92	Rūsiņš Freivalds , Carl H. Smith, On the role of procrastination for machine learning, Proceedings of the fifth annual workshop on Computational learning theory, p.363-376, July 27-29, 1992, Pittsburgh, Pennsylvania, United States  [doi>10.1145/130385.130426]
	FS93	Rūsiņš Freivalds , Carl H. Smith, On the role of procrastination in machine learning, Information and Computation, v.107 n.2, p.237-271, Dec. 1993  [doi>10.1006/inco.1993.1068]
	Gol67	E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
	HU79	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	JS94	Sanjay Jain , Arun Sharma, On the intrinsic complexity of language identification, Proceedings of the seventh annual conference on Computational learning theory, p.278-286, July 12-15, 1994, New Brunswick, New Jersey, United States  [doi>10.1145/180139.181150]
	JS95	Sanjay Jain , Arun Sharma, The structure of intrinsic complexity of learning, Proceedings of the Second European Conference on Computational Learning Theory, p.169-181, March 13-15, 1995
	JS96a	Sanjay Jain , Arun Sharma, The intrinsic complexity of language identification, Journal of Computer and System Sciences, v.52 n.3, p.393-402, June 1996  [doi>10.1006/jcss.1996.0030]
	JS96b	S. Jain and A. Sharma. The structure of intrinsic complexity of learning. Journal of Symbolic Logic, 1996. Accepted. Preliminary version in {JS95}.
	Kle38	S.C. Kleene. Notations for ordinal numbers. Jounal of Symbolic Logic, 3:150-155, 1938.
	MSW91	Tatsuya Motoki , Takeshi Shinohara , Keith Wright, The correct definition of finite elasticity: corrigendum to identification of unions, Proceedings of the fourth annual workshop on Computational learning theory, p.375, August 05-07, 1991, Santa Cruz, California, United States
	MY78	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	Rog67	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	Sac90	Gerald E. Sacks, Higher recursion theory, Springer-Verlag New York, Inc., New York, NY, 1990
	Shi86	T. Shinohara. Studies on Inductive Inference from Positive Data. PhD thesis, Kyushu University, Kyushu, Japan, 1986.
	Shi91	Takeshi Shinohara, Inductive inference of monotonic formal systems from positive data, New Generation Computing, v.8 n.4, p.371-384, 1991  [doi>10.1007/BF03037094]
	Shi94	Takeshi Shinohara, Rich classes inferable from positive data, Information and Computation, v.108 n.2, p.175-186, Feb. 1, 1994  [doi>10.1006/inco.1994.1006]
	Smu61	R. Smullyan. Theory of Formal Systems, Annals of Mathematzcal Studies, No. 47. Princeton, N J, 1961.
	Wri89	Keith Wright, Identification of unions of languages drawn from an identifiable class, Proceedings of the second annual workshop on Computational learning theory, p.328-333, December 1989, Santa Cruz, California, United States

• 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