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	Alfred V. Aho , Jeffrey D. Ullman, Principles of Compiler Design (Addison-Wesley series in computer science and information processing), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1977
	2	R. P. Brent , H. T. Kung, The chip complexity of binary arithmetic, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.190-200, April 28-30, 1980, Los Angeles, California, United States  [doi>10.1145/800141.804666]
	3	EHRI~NFEUCHT, A, AND ZIHGER, P Complexity measures for regular expressions J Comput. Syst Sct 12, 2(Apt 1976), 134-146
	4	J. P. Gray, Introduction to silicon compilation, Proceedings of the 16th Conference on Design automation, p.305-306, June 25-27, 1979, San Diego, CA, United States
	5	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	6	Dave Johannsen, Bristle Blocks: A silicon compiler, Proceedings of the 16th Conference on Design automation, p.310-313, June 25-27, 1979, San Diego, CA, United States
	7	LEISERSON, C E. Area-efficient graph layouts (for VLSI) Proc 21st Ann IEEE Symp on Foundairons of Computer Science, Oct 1980, Syracuse, N Y, pp 270-281
	8	LESK, M E LEX--A lexlcal analyzer generator Tech Rep CSTR-39, Bell Laboratories, Murray Hilt, N J, 1976
	9	LEWIS, P M 11, STEARNS, R IS, AND HARTMANIS, J Memory bounds for the recognmon of contextfree and context-sensmve languages Proc, {EEE 6th Ann Syrup on Switching C~rcutt Theory and Logical Design, Oct 1965, pp 191-202
	10	MCNAUGHTON, R, AND YAMADA, H Regular expressions and state graphs for automata IEEE Trans Comput C9, 1 (Mar 1960), 39-47
	11	Carver Mead , Lynn Conway, Introduction to VLSI Systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1979
	12	MUKHOPADHYAY, A Hardware algorithms for nonnumeric computation IEEE Trans Comput C28, 6 (June 1979), 384-394
	13	SIEWIOREK, D P A survey of research on synthesas, evaluation, and automation of digital systems at CMU Dep of Computer Science, Carnegie Mellon Umv, P~ttsburgh, Pa, 1979
	14	C. D. Thompson, Area-time complexity for VLSI, Proceedings of the eleventh annual ACM symposium on Theory of computing, p.81-88, April 30-May 02, 1979, Atlanta, Georgia, United States  [doi>10.1145/800135.804401]
	15	VALIANT, L Unlversahty considerations an VLSI orcults IEEE Trans Comput 30, 2 (Feb 1981), 135-t40

• 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