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	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]
	2	Frederick P. Brooks, Jr., The mythical man-month (anniversary ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995
	3	Juris Hartmanis , Herbert Lin, Computing the future: a broader agenda for computer science and engineering, National Academy Press, Washington, DC, 1992
	4	Juris Hartmanis, Some Observations About the Nature of Computer Science, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, p.1-12, December 15-17, 1993
	5	Hartmanis, J. and Stearns, R.E. On the computational complexity of algorithms. Trans Amer. Math. Soc., 177 (1965), 285-306.
	6	Ming Li , Paul Vitányi, An introduction to Kolmogorov complexity and its applications, Springer-Verlag New York, Inc., New York, NY, 1993
	7	Lewis, P.M., Stearns, .R,E., and Hartmanis., .J. Memory bounds for the recognition for context-tree and context- sensitive languages. In Proceedings of IEEE Sixth ANNUALSym- posium on Switching Circuit theory and Logical Design.. (1965), pp. 191-202.
	8	Mccullach, W.S. A historical introduction to the postulational foundations of experimental epistemology. In Cross cultural Understanding.Epistemology in ANTROpoLogy, F.C.S, Northrop, and H.H.. Livingston, Eds., Harper and Row., New York, 1964
	9	John McCarthy, Mathematical logic in artificial intelligence, The artificial intelligence debate: false starts, real foundations, MIT Press, Cambridge, MA, 1989
	10	Savitch W.J. RelatiON ship between delcrnt in is tit: and determinisfic tape contplexities.J, c'omput. Syst. sci., 4. (1970), 177-192.
	11	Adi Shamir, IP = PSPACE, Journal of the ACM (JACM), v.39 n.4, p.869-877, Oct. 1992  [doi>10.1145/146585.146609]
	12	Shahnon, C. the mathematical Theory COmmunication. Bell System TECH. J. 2 7 (1948), 379-656,
	13	STearns, R,E ..... Hartmanis, J., and Lewis, P.M. Hierarchies of memory limited computations. In Proceeding, of IEEE Sixth Annual Symposium of Switching Circuit Theory and Logical Design. (1965), pp. 179-190.
	14	Turing, A.M. On computable numbers with an application to the Entscheidungaproblem Proceeding's of the London Mathematical Society, series 2, 42 (1936), 230-265.
	15	Yamada, H. Real-time computation and recursive functions not real-time Computable, IEEE Trans. Elec. Comput, 11, 6 (1962), 753-760.
	16	Younger, D.H. Recognition and parsing of context-free languages in time. n3. Information and Control 10, 2 (1967), 189-208.

• 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 conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski