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	Sigrún Andradóttir , Daniel P. Heyman , Teunis J. Ott, Variance reduction through smoothing and control variates for Markov chain simulations, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.3 n.3, p.167-189, July 1993  [doi>10.1145/174153.174154]
	2	Søren Asmussen, Queueing simulation in heavy traffic, Mathematics of Operations Research, v.17 n.1, p.84-111, Feb. 1992  [doi>10.1287/moor.17.1.84]
	3	Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975  [doi>10.1145/321879.321887]
	4	Dimitri Bertsekas , Robert Gallager, Data networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	5	Bertsimas, D., I. Ch. Paschalidis, and J. N. Tsitsiklis. 1994. Optimization of multiclass queueing networks: polyhedral and nonlinear characterizations of achievable performance. Annals of Applied Probability 4:43-75.
	6	Billingsley, P. 1986. Probability and measure, 2nd ed. Wiley, New York.
	7	Bramson, M. 1994. Instability of FIFO queueing networks. Annals of Applied Probability 4:414-431.
	8	Paul Bratley , Bennett L. Fox , Linus E. Schrage, A guide to simulation (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	9	Buzacott J. A., and J. G. Shanthikumar. 1993. Stochastic models of manufacturing systems. Prentice Hall.
	10	Chen, H. 1995. Fluid approximations and stability of multiclass queueing networks: work-conserving discipiines. Annals of Applied Probability 5:637. 665.
	11	Dai, J. G. 1995. On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability 5:49-77.
	12	Gershwin S. B. 1993. Manufacturing systems engineering. Englewood Cliffs, NJ: Prentice Hall.
	13	Henderson S. G. 1997. Variance reduction via an approximating Markov process. Ph.D. Thesis, Department of Operations Research, Stanford University, CA. http://www-or.stanford.edu/msimlib/theses.html
	14	Kelly, F. P. 1979. Reversibility and stochastic networks. New York, NY: John Wiley and Sons.
	15	Kumar, S., and P. R. Kumar. 1994a. Performance bounds for queueing networks and scheduling policies. IEEE Transactions on Automatic Control 39:1600-1611.
	16	Kumar, S., and P. R. Kumar. 1994b. Fluctuation smoothing policies are stable for stochastic reentrant lines. 33rd IEEE Proceedings Conference on Decision and Control 1476-1480.
	17	Kumar, P. R., and S. P. Meyn. 1995. Stability of queueing networks and scheduling policies. IEEE Transactions on Automatic Control 40:251-260.
	18	Kumar, P. R., and S. P. Meyn 1996. Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies. IEEE tinsactions on Automatic Control 41:4- 17.
	19	Stephen S. Lavenberg, Computer Performance Modeling Handbook, Academic Press, Inc., Orlando, FL, 1983
	20	Lavenberg, S. S., and P. D. Welch. 1981. A perspective on the use of control variables to increase thr efficiency of Monte Carlo simulations. Manage ment Science 27:322-335.
	21	Averill M. Law , W. David Kelton, Simulation Modeling and Analysis, McGraw-Hill Higher Education, 1997
	22	Lippman, S. 1975. Applying a new device in the op timization of exponential queueing systems. Operations Research 23:687-710.
	23	Loh, W. W. 1994. On the method of control variates. Ph.D. Thesis. Department of Operations Research, Stanford University, Stanford CA. http://www-or.stanford.edu/~simlib/theses.html
	24	Meyn, S. P., and R. L. Tweedie. 1993. Markov chaina and stochastic stability. Springer-Verlag.
	25	Nelson, B. L. 1989. Batch size effects on the efficiency of control variates in simulation. European Journal of Operational Research 43:184-196.
	26	Ou, J., and L. M. Wein. 1992. Performance bounds for scheduling queueing networks. Annals of Applied Probability 2:460-480.
	27	Rybko, A. N., and A. L. Stolyar. 1993. On the ergodicity of random processes that describe the functioning of open queueing networks. Problems of Information tinsmission 28:199-220.
	28	W. Whitt, Planning queueing simulations, Management Science, v.35 n.11, p.1341-1366, Nov. 1989  [doi>10.1287/mnsc.35.11.1341]

• 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