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	Richard Bartels , Barry Joe, On generating discrete linear l∞0E test problems, SIAM Journal on Scientific and Statistical Computing, v.10 n.3, p.550-561, May 1989  [doi>10.1137/0910035]
	2	CHOW, T. S. A class of Hessenberg matrices with known eigenvalues and inverses. SIAM Rev. 11 (1969), 391-395
	3	CLEMENT, P.A. A class of triple-diagonal matrices for test purposes. SIAM Rev. I (1959), 50-52.
	4	CLINE, A. K., AND REW, R. K. A set of counter-examples to three condition number estimators. SlAM J. Scz Star. Comput. 4 (1983), 602 611.
	5	COLEMAN, T. F., AND VAN LOAN, C. F. Handbook for Matrix Computations. Society for Industrial and Applied Mathematics, Philadelphia, 1988.
	6	DAVIS, P.J. Circulant Matrices. Wiley, New York, 1977.
	7	DEMMEL, J. W., AND McKENNEY, A A test matrix generation suite. LAPACK Working Note ~9, Courant Institute of Mathematical Sciences, New York, 1989.
	8	DORR, F.W. An example of ill-conditioning in the numerical solution of singular perturbation problems. Math. Comput. 25 (1971), 271-283.
	9	I. S. Duff , Roger G. Grimes , John G. Lewis, Sparse matrix test problems, ACM Transactions on Mathematical Software (TOMS), v.15 n.1, p.1-14, March 1989  [doi>10.1145/62038.62043]
	10	W. H. Enright , J. D. Pryce, Two FORTRAN packages for assessing initial value methods, ACM Transactions on Mathematical Software (TOMS), v.13 n.1, p.1-27, March 1987  [doi>10.1145/23002.27645]
	11	FRANK, W.L. Computing eigenvalues of complex matrices by determinant evaluation and by methods of Danilewski and Wielandt. J. Soc. Indust. Appl. Math. 6 (1958), 378-392.
	12	GAY, D. M. Electronic mail distribution of linear programming test problems. Math. Program. Soc. COAL Newsl. (Dec. 1985), pp. 10-12.
	13	GEAR, C. W. A simple set of test matrices for eigenvalue programs. Math. Comput. 23 (1969), 119-125.
	14	GOLUB, G. H., AND VAN LOA~, C. F. Matrix Computations. Second Ed., Johns Hopkins University Press, Baltimore, Md., 1989.
	15	GRAHAM, R. L., AND SLOANE, N. J.A. Anti-Hadamard matrices. Linear Algebra Appl. 62 (1984), 113-137.
	16	GREGORY, R. T., AND KARNEY, D. L. A Collection of Matrices for Testing Computational Algorithms. Wiley, New York, 1969.
	17	Nicholas J. Higham, FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation, ACM Transactions on Mathematical Software (TOMS), v.14 n.4, p.381-396, Dec. 1988  [doi>10.1145/50063.214386]
	18	Nicholas J. Higham, A Collection of Test Matrices in MATLAB, Cornell University, Ithaca, NY, 1989
	19	Nicholas J. Higham, Experience with a matrix norm estimator, SIAM Journal on Scientific and Statistical Computing, v.11 n.4, p.804-809, July 1990  [doi>10.1137/0911047]
	20	HIGHAM, N. J., AND HIaUAM, D. J. Large growth factors in Gaussian elimination with pivoting. SIAM J. Matrix Anal. Appl. 10, 2 (1989), 155-164.
	21	HORN, R. A., AND JOUNSON, C.R. Matrix Analys~s. Cambridge University Press, 1985.
	22	KARAN, W. Numerical linear algebra. Canadian Math. Bull. 9 (1966), 757-801.
	23	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	24	LAUCHH, P. Jordan-Elimination und Ausgleichung nach kleinsten Quadraten. Numer. Math. 3 (1961), 226-240.
	25	LOTKIN, M. A set of test matrices. M.T.A.C., 9 (1955), 153-161.
	26	Irvin J. Lustig, An analysis of an available set of linear programming test problems, Computers and Operations Research, v.16 n.2, p.173-184, Mar. 1989  [doi>10.1016/0305-0548(89)90018-X]
	27	MOLER, C. B., LITTLE, J. N., AND BANGERT, S. PC-Matlab User's Guide and Pro-Matlab User's Guide. The MathWorks Inc., South Natick, Mass., 1987.
	28	Jorge J. Moré , Burton S. Garbow , Kenneth E. Hillstrom, Testing Unconstrained Optimization Software, ACM Transactions on Mathematical Software (TOMS), v.7 n.1, p.17-41, March 1981  [doi>10.1145/355934.355936]
	29	John R. Rice , Ronald F. Boisvert, Solving elliptic problems using ELLPACK, Springer-Verlag New York, Inc., New York, NY, 1985
	30	ROESLER, F. Riemann's hypothesis as an eigenvalue problem. Linear Algebra Appl. 81 (1986), 153-198.
	31	Axel Ruhe, Closest normal matrix finally found], BIT, v.27 n.4, p.585-598, Oct. 1987  [doi>10.1007/BF01937278]
	32	RUTISHAUSER, H. On test matrices. Programmation en Math~matiques Num~riques, J~ditions Centre Nat. Recherche Sci., Paris, 165 (1966), 349-365.
	33	SIGMON, K. MATLAB Primer. Dept. of Mathematics, Univ. of Florida, Gainesville, 1989.
	34	STEWART, G.W. The efficient generation of random orthogonal matrices with an application to condition estimators. SIAM J. Numer. Anal. 17 (1980), 403-409.
	35	WATHEN, A.J. Realistic eigenvalue bounds for the Galerkin mass matrix. IMA J. Numer. Anal. 7 (1987) 449-457.
	36	WESTLAKE, J. R. A Handbook of Numerical Matrix Inversion and Solution of Linear Equations. Wiley, New York, 1968.
	37	G. Zielke, Report on test matrices for generalized inverses, Computing, v.36 n.1-2, p.105-162, 1986  [doi>10.1007/BF02238196]

• 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