On connectedness in two-way elimination of heterogeneity designs
From MaRDI portal
Publication:1216141
DOI10.1214/AOS/1176343137zbMath0303.62063OpenAlexW1581425424MaRDI QIDQ1216141
Walter T. Federer, Damaraju Raghavarao
Publication date: 1975
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176343137
Related Items (9)
Approximate theory of multiway block designs ⋮ Relationships of optimality for individual factors of a design ⋮ A class of saturated row-column designs ⋮ Decomposability of the C-matrix of a two-way elimination of heterogeneity design ⋮ Decomposable three-way layouts ⋮ On the connectedness of saturated square designs ⋮ E-optimality of some row and column designs ⋮ Connected row-column \(L\)-designs for symmetrical parallel line assays with two preparations ⋮ On the connectivity problem for \(m\)-way designs
This page was built for publication: On connectedness in two-way elimination of heterogeneity designs