Permutation tests - a revival?! II: An efficient algorithm for computing the critical region
type: Item
instance of: scholarly article
title: Permutation tests - a revival?! II: An efficient algorithm for computing the critical region
zbMATH Open document ID: 0977.62048
DOI: 10.1007/BF02925374
author: Jens Gebhard
author: N. Schmitz
published in: Statistical Papers
publication date: 1998-05-12T00:00:00Z
review text: 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)].
Mathematics Subject Classification ID: 62G10
zbMATH DE Number: 1129291
zbMATH Keywords: Green-algorithm
reviewed by: Barbara Szyszkowicz
MaRDI profile type: Publication
cites work: Q4154030
cites work: Q4372481
cites work: Q4860267
cites work: Permutation tests - a revival?! I: Optimum properties
cites work: On Obtaining Permutation Distributions in Polynomial Time
full work available at URL: https://doi.org/10.1007/bf02925374
OpenAlex ID: W2324772121
description: scientific article; zbMATH DE number 1129291