The following pages link to (Q3374252):
Displaying 46 items.
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- A formal logic approach to constrained combinatorial testing (Q616856) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Augmentation of covering arrays of strength two (Q897271) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- Tabu search for covering arrays using permutation vectors (Q953845) (← links)
- Constructions of new orthogonal arrays and covering arrays of strength three (Q965209) (← links)
- Covering arrays from cyclotomy (Q970532) (← links)
- Covering arrays of strength 3 and 4 from holey difference matrices (Q1009124) (← links)
- Linear hash families and forbidden configurations (Q1009168) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- Improved strength four covering arrays with three symbols (Q1706436) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- Covering arrays of strength three from extended permutation vectors (Q1791674) (← links)
- Problems and algorithms for covering arrays (Q1876683) (← links)
- Mixed optimization combinatorial method for constructing covering arrays (Q2017763) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Covering array EXtender (Q2242769) (← links)
- Consecutive covering arrays and a new randomness test (Q2266901) (← links)
- Bipartite locating array (Q2287790) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Resolvable covering arrays (Q2320870) (← links)
- Optimality and constructions of locating arrays (Q2322059) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- Tower of covering arrays (Q2352791) (← links)
- Covering arrays on product graphs (Q2409504) (← links)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Strength two covering arrays: existence tables and projection (Q2470443) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- Construction of non-isomorphic covering arrays (Q3178165) (← links)
- Coloured and Directed Designs (Q3295270) (← links)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
- Mixed covering arrays on graphs of small treewidth (Q5063252) (← links)
- Non-uniform covering array with symmetric forbidden edge constraints (Q5206931) (← links)
- (Q5241120) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- A Logic-Based Approach to Combinatorial Testing with Constraints (Q5458811) (← links)
