Some more robust block designs against the unavailability of data
From MaRDI portal
Recommendations
- Conditions for the robustness of block designs against the unavailability of data
- Improved conditions for the robustness of binary block designs against the loss of whole blocks
- Robustness to the unavailability of data in block designs
- scientific article; zbMATH DE number 774837
- The use of treatment concurrences to assess robustness of binary block designs against the loss of whole blocks
Cites work
- scientific article; zbMATH DE number 3521980 (Why is no real title available?)
- scientific article; zbMATH DE number 3453625 (Why is no real title available?)
- Conditions for the robustness of block designs against the unavailability of data
- Equireplicate balanced block designs with unequal block sizes
- On a class of variance balanced block designs
- On a robustness property of PBIBD
- Robustness of BIBD against the unavailability of data
Cited in
(7)- Robustness of BIB and extended BIB designs against the unavailability of any number of observations in a block
- The robustness of resolvable block designs against the loss of whole blocks or replicates
- Conditions for the robustness of block designs against the unavailability of data
- Improved conditions for the robustness of binary block designs against the loss of whole blocks
- The use of treatment concurrences to assess robustness of binary block designs against the loss of whole blocks
- Robustness to the unavailability of data in block designs
- A note on robustness of D-optimal block designs for two-colour microarray experiments
This page was built for publication: Some more robust block designs against the unavailability of data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193977)