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.

Digital Library

Google Scholar

[7]

LEVINE, D. A. Algorithm 344, Student's t-distribution. Comm. ACM 12 (Jan. 1969), 37.

Digital Library

Google Scholar

[8]

IBBETSON, D. Algorithm 209, Gauss. Comm. A CM 6 (Oct. 1963), 616.

Digital Library

Google Scholar

[9]

HILL, I. D., AND JOYCE, S. A. Algorithm 304, Normal. Comm. ACM 10 (June 1967), 374.

Digital Library

Google Scholar

[10]

SMIRNOV, N.V. Tables for the Distribution and Density Functions of t-Distribution. Pergamon Press, New York, 1961.

Google Scholar

[11]

HILL, G. W. Algorithm 395, Student's t-distribution Comm. ACM 18 (Oct. 1970), 617--618.

Digital Library

Google Scholar

[12]

HILL, G.W. Progress results on asymptotic approximations for Student's t. Unpublished manuscript, Oct. 1969.

Google Scholar

[13]

FISHER, R. A., AND YATES, F. Statistical Tables for Biological Agricultural and Medical Research. Oliver and Boyd, London.

Google Scholar

[14]

SmRNOV, N.V. Tables for the Distribution and Density Functions of t-Distribution. Pergamon Press, New York, 1961.

Google Scholar

[15]

FEDERIGHI, E .T . Extended tables of the percentage points of Student's t-distribution. J. Amer. Stat. Assoc. 554 (1959), 683-688.

Google Scholar

[16]

CHANG, S. K., AND GILL, A. Algorithmic solution of the change-making problem. J. ACM 17 (Jan. 1970) 113-122

Digital Library

Google Scholar

[17]

BERGE, C., AND GHOUILA-HouRI, A. Programmes, Jeux et Reseaux de Transport. Dunod, Paris, 1962, pp. 179-182.

Google Scholar

[18]

BERGE, C., AND GHOUILA-HouRI, A. Programming, Games and Transportation Networks. Methuen, London, and Wiley, New York, 1965, pp. 177-180.

Google Scholar

[19]

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.

Crossref

Google Scholar

[20]

OBRUCA, A. Algorithm 1. Mintree. Computer Bull. (Sept. 1964) 67.

Google Scholar

[21]

KNUTH, D .E . The Art of Computer Programming, Vol I Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968. pp. 370-371.

Digital Library

Google Scholar

[22]

BAUER, F. L. Algorithm 60, Romberg integration. Comm. ACM 4 (June 1961), 255.

Digital Library

Google Scholar

[23]

FAINWEATHER, G. Algorithm 351, Modified Romberg quadrature. Comm. ACM 12 (June 1969), 324-325.

Digital Library

Google Scholar

[24]

KRASUN, A. M., AND PRAGEH, W. Remark on Romberg quadrature. Comm. ACM 8 (Apr. 1965), 236-237.

Digital Library

Google Scholar

[25]

NUBIK, R.N. Algorithm 257, Havie integrator. Comm. ACM 8 (June 1965), 381.

Digital Library

Google Scholar

[26]

PERLIS, A. J ., AND SAMELSON, K. Preliminary report-international algebraic language. Comm. ACM 1 (Dec. 1958), 8-22.

Digital Library

Google Scholar

[27]

RUTISHAUSER, H. Description of Algol 60. In Handbook for Automatic Computation, Vol. 1. Springer-Verlag, New York, 1967, Parta, pp. 105-106.

Google Scholar

Cited By

View all

Tawosi VAlamir SLiu X(2023)Search-Based Optimisation of LLM Learning Shots for Story Point EstimationSearch-Based Software Engineering10.1007/978-3-031-48796-5_9(123-129)Online publication date: 8-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-48796-5_9
Sarro FPetrozziello AHarman MDillon LVisser WWilliams L(2016)Multi-objective software effort estimationProceedings of the 38th International Conference on Software Engineering10.1145/2884781.2884830(619-630)Online publication date: 14-May-2016
https://dl.acm.org/doi/10.1145/2884781.2884830

Recommendations

Algorithm 396: Student's t-quantiles
An efficient algorithm for computing quantiles of the noncentral chi-squared distribution
Tailweight, quantiles and kurtosis: A study of competing distributions

This paper studies analytically and numerically the tail behavior of the symmetric variance-gamma (VG), t, and exponential-power (EP) distributions. Special emphasis is on the VG, which is a direct competitor of the t in the financial context of ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 13, Issue 10

Oct. 1970

127 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/355598

Editor:
M. Stuart Lynn
IBM Scientific Center, Houston, TX

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1970

Published in CACM Volume 13, Issue 10

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
1,211
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)11

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tawosi VAlamir SLiu X(2023)Search-Based Optimisation of LLM Learning Shots for Story Point EstimationSearch-Based Software Engineering10.1007/978-3-031-48796-5_9(123-129)Online publication date: 8-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-48796-5_9
Sarro FPetrozziello AHarman MDillon LVisser WWilliams L(2016)Multi-objective software effort estimationProceedings of the 38th International Conference on Software Engineering10.1145/2884781.2884830(619-630)Online publication date: 14-May-2016
https://dl.acm.org/doi/10.1145/2884781.2884830

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Algorithm 396: Student's t-quantiles

An efficient algorithm for computing quantiles of the noncentral chi-squared distribution

Tailweight, quantiles and kurtosis: A study of competing distributions

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations