ACM Algorithm 395: Student's t-distribution

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	GOSSET, W. S. (Student). On the probable error of a mean. Biometrika 6 (1908), 1.
	2	HILL, G. W., AND DAVIS, A. W. Generalized asymptotic expansions of Cornish-Fisher type. Ann. Math. Statist. 39, 4(1968), 1264.
	3	HILL, G. W. Progress results on asymptotic approximations for Student's t. Unpublished manuscript, Oct. 1969.
	4	FISHER, R. A. Expansion of "Student's" integral in powers of n-L Metron, 5 (1926), 109-112.
	5	MoRRis, J. Algorithm 321, t-test. Comm. ACM 11 (Feb. 1968), 115.
	6	ABRAMOWITZ, M., AND STEGUN, I. A. (Eds.) Handbook of Mathematical Functions. Appl. Math. Ser. Vol. 55, Nat. Bur. Stand., US Govt. Printing Off., Washington, D.C., 1965, p. 948.
	7	David A. Levine, Algorithm 344: student's t-distribution [S14], Communications of the ACM, v.12 n.1, p.37-38, Jan. 1969 [doi>10.1145/362835.362841]
	8	D. Ibbetson, Algorithm 209: Gauss, Communications of the ACM, v.6 n.10, p.616, Oct. 1963 [doi>10.1145/367651.367664]
	9	I. D. Hill , S. A. Joyce, Algorithm 304: Normal curve integral, Communications of the ACM, v.10 n.6, p.374-375, June 1967 [doi>10.1145/363332.363411]
	10	SMIRNOV, N.V. Tables for the Distribution and Density Functions of t-Distribution. Pergamon Press, New York, 1961.
	1	G. W. Hill, ACM Algorithm 395: Student's t-distribution, Communications of the ACM, v.13 n.10, p.617-619, Oct. 1970 [doi>10.1145/355598.355599]
	2	HILL, G.W. Progress results on asymptotic approximations for Student's t. Unpublished manuscript, Oct. 1969.
	3	FISHER, R. A., AND YATES, F. Statistical Tables for Biological Agricultural and Medical Research. Oliver and Boyd, London.
	4	SmRNOV, N.V. Tables for the Distribution and Density Functions of t-Distribution. Pergamon Press, New York, 1961.
	5	FEDERIGHI, E .T . Extended tables of the percentage points of Student's t-distribution. J. Amer. Stat. Assoc. 554 (1959), 683-688.
	1	S. K. Chang , A. Gill, Algorithmic Solution of the Change-Making Problem, Journal of the ACM (JACM), v.17 n.1, p.113-122, Jan. 1970 [doi>10.1145/321556.321567]
	1	BERGE, C., AND GHOUILA-HouRI, A. Programmes, Jeux et Reseaux de Transport. Dunod, Paris, 1962, pp. 179-182.
	2	BERGE, C., AND GHOUILA-HouRI, A. Programming, Games and Transportation Networks. Methuen, London, and Wiley, New York, 1965, pp. 177-180.
	3	KRUSKAL, J. B., JR. On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 7 (1956) 48--50.
	4	OBRUCA, A. Algorithm 1. Mintree. Computer Bull. (Sept. 1964) 67.
	5	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	1	F. L. Bauer, Algorithm 60: Romberg integration, Communications of the ACM, v.4 n.6, p.255, June 1961 [doi>10.1145/366573.366594]
	2	Algorithm 351: modified Romberg quadrature, Communications of the ACM, v.12 n.6, p.324-326, June 1969 [doi>10.1145/363011.363031]
	3	A. M. Krasun , W. Prager, Remark on Romberg quadrature, Communications of the ACM, v.8 n.4, p.236-237, April 1965 [doi>10.1145/363831.364901]
	4	Robert N. Kubik, Algorithm 257: Havie integrator, Communications of the ACM, v.8 n.6, p.381, June 1965 [doi>10.1145/364955.364978]
	5	A. J. Perlis , K. Samelson, Preliminary report: international algebraic language, Communications of the ACM, v.1 n.12, p.8-22, Dec. 1958 [doi>10.1145/377924.594925]
	6	RUTISHAUSER, H. Description of Algol 60. In Handbook for Automatic Computation, Vol. 1. Springer-Verlag, New York, 1967, Parta, pp. 105-106.