Detecting arrays for effects of multiple interacting factors
From MaRDI portal
Cites work
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- A Sperner-type theorem for set-partition systems
- A survey of combinatorial testing
- A survey of cover-free families: constructions, applications, and generalizations
- A survey of methods for constructing covering arrays
- Algorithmic methods for covering arrays of higher index
- An efficient screening method for identifying parameters and interactions that impact wireless network performance
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Constructing new covering arrays from LFSR sequences over finite fields
- Constructions and bounds for separating hash families
- Covering and radius-covering arrays: constructions and classification
- Covering arrays and hash families
- Covering arrays of higher strength from permutation vectors
- Covering arrays of strength three from extended permutation vectors
- Covering strong separating hash families
- Detecting arrays and their optimality
- Detecting arrays for effects of single factors
- Detecting arrays for main effects
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1857520 (Why is no real title available?)
- Introduction to combinatorial testing
- Locating and detecting arrays for interaction faults
- Locating errors using ELAs, covering arrays, and adaptive testing algorithms
- Mixed-level covering, locating, and detecting arrays via cyclotomy
- More constructions for Sperner partition systems
- New bounds on the maximum size of Sperner partition systems
- On a combinatorial framework for fault characterization
- Optimum detecting arrays for independent interaction faults
- Optimum mixed level detecting arrays
- Separating interaction effects using locating and detecting arrays
- Small arrays of maximum coverage
- Software and hardware testing using combinatorial covering suites
- Sperner partition systems
- Subspace restrictions and affine composition for covering perfect hash families
- The equivalence between optimal detecting arrays and super-simple OAs
- The Lovász local lemma and its applications to some combinatorial arrays
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- There must be fifty ways to miss a cover
This page was built for publication: Detecting arrays for effects of multiple interacting factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647744)
