login

An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests

ACM Transactions on Mathematical SoftwarePublished 1 March 1977
Teofilo F. Gonzalez, Sartaj Sahni, W. R. Franta
Citations40
SJR quartileQ1
SJR score1.23
SNIP2.12

TL;DR

This research was supported in part by the National Science Foundation under Grant DCR 74-10081.

Abstract

article Free Access Share on An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests Authors: Teofilo Gonzalez Department of Computer, Information and Control Sciences, 114 Main Engineering Building, Minneapolis, MN Department of Computer, Information and Control Sciences, 114 Main Engineering Building, Minneapolis, MNView Profile , Sartaj Sahni Department of Computer, Information and Control Sciences, 114 Main Engineering Building, Minneapolis, MN Department of Computer, Information and Control Sciences, 114 Main Engineering Building, Minneapolis, MNView Profile , W. R. Franta Department of Computer, Information and Control Sciences, 114 Main Engineering Building, Minneapolis, MN Department of Computer, Information and Control Sciences, 114 Main Engineering Building, Minneapolis, MNView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 3Issue 1March 1977 pp 60–64https://doi.org/10.1145/355719.355724Published:01 March 1977Publication History 23citation2,096DownloadsMetricsTotal Citations23Total Downloads2,096Last 12 Months621Last 6 weeks49 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Keywords

Computer Science