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	P. Bernstein, N.Goodman, M-Y.Lai, "Analyzing concurrency control algorithms when user and system operations differ", IEEE Trans. on Software Engr., vol. SE-9, no.3 (May 1983), pp.233-239.
	2	Michael J. Carey, An abstract model of database concurrency control algorithms, Proceedings of the 1983 ACM SIGMOD international conference on Management of data, May 23-26, 1983, San Jose, California
	3	C. Ellis, "Concurrent search and insertion in 2-3 trees", Acta Informatica, 14 (1980), pp.63-86.
	4	C. Ellis, "Concurrent search and insertion in AVL trees", IEEE Trans. on Computers, vol. C-29, No. 9 (Sept. 1980), pp.811-817.
	5	K. P. Eswaran , J. N. Gray , R. A. Lorie , I. L. Traiger, The notions of consistency and predicate locks in a database system, Communications of the ACM, v.19 n.11, p.624-633, Nov. 1976  [doi>10.1145/360363.360369]
	6	H. T. Kung , C. H. Papadimitriou, An optimality theory of concurrency control for databases, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts  [doi>10.1145/582095.582114]
	7	H. T. Kung , Philip L. Lehman, Concurrent manipulation of binary search trees, ACM Transactions on Database Systems (TODS), v.5 n.3, p.354-382, Sept. 1980  [doi>10.1145/320613.320619]
	8	Y-S. Kwong, D.Wood, "A new method for concurrency in B-trees", IEEE Trans. on Software Engr., vol. SE-8, no. 3 (May 1982), pp.211-222.
	9	Philip L. Lehman , s. Bing Yao, Efficient locking for concurrent operations on B-trees, ACM Transactions on Database Systems (TODS), v.6 n.4, p.650-670, Dec. 1981  [doi>10.1145/319628.319663]
	10	Christos H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), v.26 n.4, p.631-653, Oct. 1979  [doi>10.1145/322154.322158]
	11	D. P. Reed, NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM, Massachusetts Institute of Technology, Cambridge, MA, 1978
	12	R. Schlichting, F. Schneider, "Using message passing for distributed programming: proof rules and disciplines", Tech. Rept. TR82-5 (June 1982), Dept. of Computer Science, Univ. of Arizona, Tucson, Arizona.
	13	William Weihl , Barbara Liskov, Specification and implementation of resilient, atomic data types, Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems, p.53-64, June 27-29, 1983, San Francisco, California, United States
	14	William E. Weihl, Data-dependent concurrency control and recovery (Extended Abstract), Proceedings of the second annual ACM symposium on Principles of distributed computing, p.63-75, August 17-19, 1983, Montreal, Quebec, Canada  [doi>10.1145/800221.806710]

• 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