Skip Navigation

The Computer Journal 1969 12(4):373-376; doi:10.1093/comjnl/12.4.373
© 1969 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Downham, D. Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The runs up and down test

D. Y. Downham *

Department of Computational and Statistical Science, The University, Liverpool, UK

The ‘runs up and down’ test has been shown to have certain advantages for testing a sequence of pseudo-random numbers for ‘randomness’. The test is discussed in some detail: certain results, that have in the past been proved asymptotically, are derived exactly.

Received May 1969.

* Department of Computational and Statistical Science, The University, Liverpool 3 (Year 1969–70, Department of Statistics and Computer Science, West Virginia University, Morgantown, West Virginia)


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.