Permutation tests - a revival?! II: An efficient algorithm for computing the critical region
Continuing part I of their paper, see the preceding entry, Zbl 0977.62047, here the authors formulate an algorithm for the two-sample problem that is dealt with in Part I. The proposed algorithm avoids the explicit consideration of all permutations for constructing the critical region. The algorithm itself is due to \textit{M. Pagano} and \textit{D. Tritchler} [J. Am. Stat. Assoc. 78, 435-440 (1983; Zbl 0517.62030)]. The performance of this algorithm is studied and compared with the performance of the Green-algorithm [cf. Am. Stat. 31, 37-39 (1977)].
scientific article; zbMATH DE number 1129291