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	Axw, POn a subrecursive hierarchy and primitive recurslve degrees Trans. AMS 92 (1959), 85-105
	2	BORODIN, A, CONSTABLE, R L, ~_ND HOPCROFT, J E Dense and nondense famihes of complexlty classes IEEE Conf Record Tenth Annual Syrup on Swltchang and Automata Theory, 1969, pp. 7-19
	3	Stephen A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, p.151-158, May 03-05, 1971, Shaker Heights, Ohio, United States  [doi>10.1145/800157.805047]
	4	Fr~I~:DB}~RG, It M Two recurs~vely enumerable sets of incomparable degrees of unsolvablhty. Proc Nat Acad Scz U S A. $3 (1957), 236-238
	5	GrtZEGORCZYK, A. Some Classes of Rect~rswe Fancl~ons Rozprawy Matematyczhe, Warsaw, 1953
	6	KARP, R M Reducibility among combinatorial problems In Complexity of Computer Computatwns, R. E Mtller and J. W Thatcher, Eds., Plenum, New York, 1972, pp. 85-103.
	7	K~aP, R M Private commumcat~on.
	8	KLEENE, S C , AND POST, E L. The uppersem~-latUce of degrees of unsolvabihty Ann. Math., Ser. 2, 59 (1954), 379-407
	9	Richard Ladner , Nancy Lynch , Alan Selman, Comparison of polynomial-time reducibilities, Proceedings of the sixth annual ACM symposium on Theory of computing, p.110-121, April 30-May 02, 1974, Seattle, Washington, United States  [doi>10.1145/800119.803891]
	10	N. A. Lynch, RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY, Massachusetts Institute of Technology, Cambridge, MA, 1972
	11	Michael Machtey, Classification of computable functions by primitive recursive classes, Proceedings of the third annual ACM symposium on Theory of computing, p.251-257, May 03-05, 1971, Shaker Heights, Ohio, United States  [doi>10.1145/800157.805054]
	12	M~CHTEY, M Augmented loop languages and classes of computable functions J Comput. Sys~ Sc~. 6, 6 (1972), 603-624
	13	MACHTEY, M The honest subrecurslve classes are a lattice. I~form and Contr. 24, 3 (1974), 247-263.
	14	MACHT}.Y, M On the density of honest subrecurstve classes. Tech Rep. CSD TR 92, Comput. Sc~. Dep, Purdue U., Lafayette, Ind, 1973
	15	MEYER, A R , AND R~TCHIL, D M A classification of the recursLve functmns Z Math Log~k Grul~dlagen Math 18 (1972), 71-82
	16	MEYER, A R Private commumcatmn
	17	MUCHNIK, A A On the unsolvabillty of the problem of reducibfilty m the theory of algorithms. Doklady Akadcm~ Navk SSSR, n s , 108 (1956), 194-197
	18	PosT, E. L Recurslvely enumerable sets of posttlve integers and their decision problems. bull. AMS 50 (1944), 284-316
	19	Pi~ iTT, V Every prime has a succinct certificate (In preparation )
	20	RITCHIE, R W Classes of predictably computable functions Trans AMS 106 (1963), 139-173.
	21	RoGrms Ji~, H Theory of Recurszve Funchons a~d Effective Computab~.hty McGraw-Hill, New York, 1967
	22	Ravi Sethi, Complete register allocation problems, Proceedings of the fifth annual ACM symposium on Theory of computing, p.182-195, April 30-May 02, 1973, Austin, Texas, United States  [doi>10.1145/800125.804049]
	23	Larry Stockmeyer, Planar 3-colorability is polynomial complete, ACM SIGACT News, v.5 n.3, p.19-25, July 1973  [doi>10.1145/1008293.1008294]
	24	L. J. Stockmeyer , A. R. Meyer, Word problems requiring exponential time(Preliminary Report), Proceedings of the fifth annual ACM symposium on Theory of computing, p.1-9, April 30-May 02, 1973, Austin, Texas, United States  [doi>10.1145/800125.804029]
	25	J. D. Ullman, Polynomial complete scheduling problems, Proceedings of the fourth ACM symposium on Operating system principles, p.96-101, January 1973

• 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