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	D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. In preparation.
	2	D. Aidous and U. ~3.zirani. A Markovian extension of Valiant's learning model. Proc. 31st Symposium on 1990.
	3	Martin Anthony , Norman Biggs, Computational learning theory: an introduction, Cambridge University Press, New York, NY, 1992
	4	Peter L. Bartlett , Paul Fischer , Klaus-Uwe Höffgen, Exploiting random walks for learning, Proceedings of the seventh annual conference on Computational learning theory, p.318-327, July 12-15, 1994, New Brunswick, New Jersey, United States  [doi>10.1145/180139.181167]
	5	D. Bertsimas, D. Gamarnik, and J. Tsitsiklis. Geometric bounds for stationary distribution of infinite Markov Chains via Lyapunov functions. Preprint, i 998.
	6	K.L. Buescher and P.R. Kumar. Learning by canoni- 1EEE Transactions on Automatic Control, 41:545-556, 1996.
	7	K.L. Buescher and P.R. Kumar. Learning by canonical smooth estimation, part II: Learning and model complexity. IEEE Transactions on Automatic Control, 41:557-569, 1996.
	8	P. Diaconis, R. Graham, and J. Morrison. Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Structures and Aigorithms, 1:51- 72, 1990.
	9	David Gillman, A Chernoff Bound for Random Walks on Expander Graphs, SIAM Journal on Computing, v.27 n.4, p.1203-1220, Aug. 1998  [doi>10.1137/S0097539794268765]
	10	Michael J. Kearns , Umesh V. Vazirani, An introduction to computational learning theory, MIT Press, Cambridge, MA, 1994
	11	Ron Meir, Performance bounds for nonlinear time series prediction, Proceedings of the tenth annual conference on Computational learning theory, p.122-129, July 06-09, 1997, Nashville, Tennessee, United States  [doi>10.1145/267460.267488]
	12	S.P. Meyn. Computable bounds for geometric convergence rates of markov chains. Ann. ofAppl." ' ' rrou., ~, 1994.
	13	S.P. Meyn and R.L. Tweedie. MArkov Chains and Stochastie Stability. Springer-~erlag, 1993.
	14	A. Nobel. A counterexample concerning uniform ergodic theorems for a class of functions. Statistics and Probability Letters, 24:165-168, 1995.
	15	Vladimir N. Vapnik, The nature of statistical learning theory, Springer-Verlag New York, Inc., New York, NY, 1995

• 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
  
  
• 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
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski