Various code used to compute word overlap correlations per Guibas and Odlyzko, Rahmann and Rivals, Rukhin.
These programs were not written to be shared and currently most do not come with any documentation. This may change in future.
Some of this code is based on code provided by Joerg Arndt while he was a PhD student at ANU. See especially FXT: a library of algorithms
Testing the tests: using pseudorandom number generators to improve empirical tests, MCQMC, 2008.
Accurate computation of the variance of the number of missing words in a random string, 4ICC, 2008.
Paul Leopardi, "Testing the tests: using random number generators to improve empirical tests", Monte Carlo and Quasi-Monte Carlo Methods 2008, Pierre L' Ecuyer, Art B. Owen (Eds.) Springer, 2009 pp. 501--512. ISBN: 978-3-642-04106-8. Preprint: Revised July 2009.
Examines implementations of the overlapping serial tests of Marsaglia and Zaman, and improves them, using accurate calculation of the mean and variance of the number of missing words in a random string.
A152139: Correlation classes of pairs of different words, November 2008.
Suprangen: Sydney University pseudorandom number generators.