ACM Home Page
Please provide us with feedback. Feedback
Algorithm 519: Three Algorithms for Computing Kolmogorov-Smirnov Probabilities with Arbitrary Boundaries and a Certification of Algorithm 487 [S14]
Full text PdfPdf (489 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 3 ,  Issue 3  (September 1977) table of contents
Pages: 285 - 294  
Year of Publication: 1977
ISSN:0098-3500
Author
Ralph Kallman  Department of Mathematical Sciences, Ball State University, Muncie, IN
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

appendices and supplements   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355744.355754
What is a DOI?

APPENDICES and SUPPLEMENTS
RAKK is a generalization of Massey's method. DURB is Durbin's method. EPST is the Epanechnikov, Steck method: Kolmogorov-Smirnov probabilities with arbitrary boundaries
Gams: L5a1u


REFERENCES

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
DURBIN, J. Boundary crossing probabihties for the Brownian motion and Poisson processes and techmques for computing the power of the Kolmogrorov-Smirnov test. J. Appl. Probability 8 (1971), 431-453.
 
2
DURBIn, J. D,stribution Theory for Tests Based on the Sample Distribution Function. SIAM, ,Philadelphia, Pa, 1973.
 
3
MASSEY, F. A note on the estimation of a distribution function by confidence limits. Annals Math. Statist. 21 (1950), 116-119.
4
 
5
WILKS, S. Mathematical Statistics. Wiley, New York, 1962.