On the public citation graph
A Survey of Binary Covering Arrays
0 signed · 140 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jcd.10002openalex-snapshot
On the state of strength‐three covering arrays
inferredcites →https://doi.org/10.1002/jcd.20067openalex-snapshot
Covering arrays of higher strength from permutation vectors
inferredcites →https://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
inferredcites →https://doi.org/10.1002/jcd.3180030304openalex-snapshot
Bounds on orthogonal arrays and resilient functions
inferredcites →https://doi.org/10.1002/stvr.319openalex-snapshot
Combination testing strategies: a survey
inferredcites →https://doi.org/10.1002/stvr.365openalex-snapshot
The density algorithm for pairwise interaction testing
inferredcites →https://doi.org/10.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferredcites →https://doi.org/10.1006/inco.1993.1010openalex-snapshot
Subcube Fault-Tolerance in Hypercubes
inferredcites →https://doi.org/10.1007/0-387-25036-0_10openalex-snapshot
Software and Hardware Testing Using Combinatorial Covering Suites
inferredcites →https://doi.org/10.1007/3-540-44598-6_33openalex-snapshot
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
inferredcites →https://doi.org/10.1007/978-3-642-01877-0_3openalex-snapshot
Binary Covering Arrays and Existentially Closed Graphs
inferredcites →https://doi.org/10.1007/978-3-642-05258-3_35openalex-snapshot
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
inferredcites →https://doi.org/10.1007/978-3-642-10217-2_40openalex-snapshot
Randomized Postoptimization of Covering Arrays
inferredcites →https://doi.org/10.1007/978-3-642-14156-0_8openalex-snapshot
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
inferredcites →https://doi.org/10.1007/978-3-642-15108-8_10openalex-snapshot
Verification of General and Cyclic Covering Arrays Using Grid Computing
inferredcites →https://doi.org/10.1007/bf00264296openalex-snapshot
On sets of Boolean n-vectors with all k-projections surjective
inferredcites →https://doi.org/10.1007/bf01124983openalex-snapshot
Recursive generation of locally complete tests
inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1007/bf02018457openalex-snapshot
Two applications (for search theory and truth functions) of Sperner type theorems
inferredcites →https://doi.org/10.1007/s10623-006-0020-8openalex-snapshot
Roux-type constructions for covering arrays of strengths three and four
inferredcites →https://doi.org/10.1007/springerreference_205344openalex-snapshot
Foundations of Probability
inferredcites →https://doi.org/10.1016/0012-365x(73)90098-8openalex-snapshot
Families of k-independent sets
inferredcites →https://doi.org/10.1016/0012-365x(86)90161-5openalex-snapshot
Explicit construction of exponential sized families of k-independent sets
inferredcites →https://doi.org/10.1016/0095-8956(89)90054-3openalex-snapshot
Largest induced subgraphs of the n-cube that contain no 4-cycles
inferredcites →https://doi.org/10.1016/0097-3165(73)90086-1openalex-snapshot
Sperner systems consisting of pairs of complementary subsets
inferredcites →https://doi.org/10.1016/0890-5401(88)90056-9openalex-snapshot
How robust is the n-cube?
inferredcites →https://doi.org/10.1016/j.dam.2007.04.010openalex-snapshot
The test suite generation problem: Optimal instances and their implications
inferredcites →https://doi.org/10.1016/j.dam.2010.03.008openalex-snapshot
Covering and radius-covering arrays: Constructions and classification
inferredcites →https://doi.org/10.1016/j.disc.2006.06.036openalex-snapshot
Constructing strength three covering arrays with augmented annealing
inferredcites →https://doi.org/10.1016/j.ejc.2012.07.017openalex-snapshot
Randomized post-optimization of covering arrays
inferredcites →https://doi.org/10.1016/j.jspi.2006.12.003openalex-snapshot
Classification of orthogonal arrays by integer programming
inferredcites →https://doi.org/10.1016/j.jspi.2008.05.020openalex-snapshot
Tabu search for covering arrays using permutation vectors
inferredcites →https://doi.org/10.1016/j.jss.2008.02.034openalex-snapshot
A backtracking search tool for constructing combinatorial test suites
inferredcites →https://doi.org/10.1016/s0166-218x(03)00190-2openalex-snapshot
Strong qualitative independence
inferredcites →https://doi.org/10.1016/s0166-218x(03)00291-9openalex-snapshot
Upper bounds for covering arrays by tabu search
inferredcites →https://doi.org/10.1017/s0963548300001905openalex-snapshot
t-Covering Arrays: Upper Bounds and Poisson Approximations
inferredcites →https://doi.org/10.1023/b:desi.0000029232.40302.6dopenalex-snapshot
On t-Covering Arrays
inferredcites →https://doi.org/10.1080/00401706.2000.10485735openalex-snapshot
Orthogonal Arrays: Theory and Applications
inferredcites →https://doi.org/10.1080/16073606.1991.9631657openalex-snapshot
PASCALIAN RECTANGLES MODULOm
inferredcites →https://doi.org/10.1090/conm/523/10309openalex-snapshot
Heterogeneous hash families and covering arrays
inferredcites →https://doi.org/10.1093/qmath/12.1.313openalex-snapshot
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
inferredcites →https://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferredcites →https://doi.org/10.1109/18.340462openalex-snapshot
Intersecting codes and independent families
inferredcites →https://doi.org/10.1109/18.6031openalex-snapshot
Vector sets for exhaustive testing of logic circuits
inferredcites →https://doi.org/10.1109/32.605761openalex-snapshot
The AETG system: an approach to testing based on combinatorial design
inferredcites →https://doi.org/10.1109/32.979992openalex-snapshot
A test generation strategy for pairwise testing
inferredcites →https://doi.org/10.1109/apsec.2006.42openalex-snapshot
Interaction Testing in Model-Based Development: Effect on Model-Coverage
inferredcites →https://doi.org/10.1109/cec.2010.5586148openalex-snapshot
Simulated Annealing for constructing binary covering arrays of variable strength
inferredcites →https://doi.org/10.1109/ecbs.2007.47openalex-snapshot
IPOG: A General Strategy for T-Way Software Testing
inferredcites →https://doi.org/10.1109/hase.1998.731623openalex-snapshot
In-parameter-order: a test generation strategy for pairwise testing
inferredcites →https://doi.org/10.1109/icse.1997.610252openalex-snapshot
Applying Design of Experiments to Software Testing
inferredcites →https://doi.org/10.1109/icse.2003.1201186openalex-snapshot
Constructing test suites for interaction testing
inferredcites →https://doi.org/10.1109/sew.2002.1199454openalex-snapshot
An investigation of the applicability of design of experiments to software testing
inferredcites →https://doi.org/10.1109/sfcs.1992.267760openalex-snapshot
On the bit extraction problem
inferredcites →https://doi.org/10.1109/tc.1983.1676175openalex-snapshot
Exhaustive Test Pattern Generation with Constant Weight Vectors
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/1108023openalex-snapshot
Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
inferredcites →https://doi.org/10.1137/s036301299427816xopenalex-snapshot
Minimax Rendezvous on the Line
inferredcites →https://doi.org/10.1145/1007512.1007519openalex-snapshot
Covering arrays for efficient fault characterization in complex configuration spaces
inferredcites →https://doi.org/10.1145/1013886.1007519openalex-snapshot
Covering arrays for efficient fault characterization in complex configuration spaces
inferredcites →https://doi.org/10.1147/rd.282.0212openalex-snapshot
Iterative Exhaustive Pattern Generation for Logic Testing
inferredcites →https://doi.org/10.2969/jmsj/00630343openalex-snapshot
Logarithmic order of free distributive lattice
inferredcites →https://doi.org/10.4153/cmb-1974-029-1openalex-snapshot
On A Problem of Purdy Related to Sperner Systems
inferredcites →https://doi.org/10.5555/776816.776822openalex-snapshot
Constructing test suites for interaction testing
inferredcites →https://doi.org/10.5860/choice.50-2030openalex-snapshot
National Institute of Standards and Technology
inferredcites →https://doi.org/10.6028/jres.113.022openalex-snapshot
Refining the In-Parameter-Order Strategy for Constructing Covering Arrays
inferredcites →https://doi.org/10.6028/nist.ir.7308openalex-snapshot
An algorithm for generating very large covering arrays
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21553openalex-snapshot
Asymptotic Size of Covering Arrays: An Application of Entropy Compression
inferred← citeshttps://doi.org/10.1002/jcd.21671openalex-snapshot
On the structure of small strength‐2 covering arrays
inferred← citeshttps://doi.org/10.1002/jcd.70022openalex-snapshot
Lower Bounds and Construction of Detecting Arrays
inferred← citeshttps://doi.org/10.1002/jcd.70037openalex-snapshot
Exact Values and Bounds on Covering Schemes of Strength Two
inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_8openalex-snapshot
Quantitative Projection Coverage for Testing ML-enabled Autonomous Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-17729-8_3openalex-snapshot
Suitable Permutations, Binary Covering Arrays, and Paley Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-26285-7_17openalex-snapshot
Search-Based Software Engineering to Construct Binary Test-Suites
inferred← citeshttps://doi.org/10.1007/978-3-319-27060-9_13openalex-snapshot
A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-47443-4_16openalex-snapshot
Set-Based Algorithms for Combinatorial Test Set Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-25324-9_17openalex-snapshot
Optimal Shortening of Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-25324-9_18openalex-snapshot
An Exact Approach to Maximize the Number of Wild Cards in a Covering Array
inferred← citeshttps://doi.org/10.1007/978-3-642-29694-9_15openalex-snapshot
MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-37798-3_12openalex-snapshot
A Post-optimization Strategy for Combinatorial Testing: Test Suite Reduction through the Identification of Wild Cards and Merge of Rows
inferred← citeshttps://doi.org/10.1007/978-3-662-43429-1_1openalex-snapshot
Introduction to Combinatorial Testing
inferred← citeshttps://doi.org/10.1007/s11227-012-0763-0openalex-snapshot
Supercomputing and grid computing on the verification of covering arrays
inferred← citeshttps://doi.org/10.1007/s11786-021-00502-7openalex-snapshot
Factorials Experiments, Covering Arrays, and Combinatorial Testing
inferred← citeshttps://doi.org/10.1007/s12095-026-00890-2openalex-snapshot
A classification of invariant sets of constant-weight tuples and applications to covering schemes
inferred← citeshttps://doi.org/10.1007/s42081-019-00056-wopenalex-snapshot
Arrays for combinatorial interaction testing: a review on constructive approaches
inferred← citeshttps://doi.org/10.1007/s42979-023-02548-9openalex-snapshot
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1016/j.disc.2011.07.005openalex-snapshot
Forbidden configurations and repeated induction
inferred← citeshttps://doi.org/10.1016/j.disc.2014.05.013openalex-snapshot
Chromatic numbers of copoint graphs of convex geometries
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103021openalex-snapshot
Suitable sets of permutations, packings of triples, and Ramsey’s theorem
inferred← citeshttps://doi.org/10.1016/j.endm.2014.11.015openalex-snapshot
Construction of Mixed Covering Arrays Using a Combination of Simulated Annealing and Variable Neighborhood Search
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.11.007openalex-snapshot
Practical minimization of pairwise-covering test configurations using constraint programming
inferred← citeshttps://doi.org/10.1016/j.infsof.2024.107601openalex-snapshot
Top-down: A better strategy for incremental covering array generation
inferred← citeshttps://doi.org/10.1016/j.ins.2011.09.020openalex-snapshot
New bounds for binary covering arrays using simulated annealing
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.12.006openalex-snapshot
Constructions and nonexistence results for suitable sets of permutations
inferred← citeshttps://doi.org/10.1016/j.measurement.2013.02.021openalex-snapshot
Combinatorial testing for software: An adaptation of design of experiments
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103353openalex-snapshot
An adaptive pairwise testing algorithm based on deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.013openalex-snapshot
Parameterized and approximation complexity of Partial VC Dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.019openalex-snapshot
A survey on the state of the art of complexity problems for covering arrays
inferred← citeshttps://doi.org/10.1088/1757-899x/767/1/012009openalex-snapshot
Implementation of Sine Cosine Algorithm (SCA) for Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/iccad45719.2019.8942153openalex-snapshot
nn-dependability-kit: Engineering Neural Networks for Safety-Critical Autonomous Driving Systems
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654003openalex-snapshot
A Remark on Downlink Massive Random Access
inferred← citeshttps://doi.org/10.1109/memcod.2018.8556962openalex-snapshot
Towards Dependability Metrics for Neural Networks
inferred← citeshttps://doi.org/10.1109/qrs-c.2016.12openalex-snapshot
Combinatorial Testing of Software with Binary Inputs: A State-of-the-Art Review
inferred← citeshttps://doi.org/10.1109/qrs-c.2017.18openalex-snapshot
Combinatorial Methods of Feature Selection for Cell Image Classification
inferred← citeshttps://doi.org/10.1109/red.2016.7779342openalex-snapshot
Linear codes for an effective quantization of data
inferred← citeshttps://doi.org/10.1109/redundancy52534.2021.9606478openalex-snapshot
On Weight Spectrum of Linear Codes
inferred← citeshttps://doi.org/10.1109/tnnls.2017.2648039openalex-snapshot
Identifying a Probabilistic Boolean Threshold Network From Samples
inferred← citeshttps://doi.org/10.1109/tse.2020.3010317openalex-snapshot
Flexible Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/vcip.2014.7051554openalex-snapshot
Scalar-quantization-based multi-layer data hiding for video coding applications
inferred← citeshttps://doi.org/10.1117/12.2685909openalex-snapshot
On the largest minimal suitable sets of permutations
inferred← citeshttps://doi.org/10.1137/24m1700600openalex-snapshot
\({k}\)-Independent Boolean Networks
inferred← citeshttps://doi.org/10.1142/s1793830912500334openalex-snapshot
CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
inferred← citeshttps://doi.org/10.1142/s1793830918500118openalex-snapshot
New optimal covering arrays using an orderly algorithm
inferred← citeshttps://doi.org/10.13021/mars/7772openalex-snapshot
Extremal Combinatorics in Geometry and Graph Theory
inferred← citeshttps://doi.org/10.1371/journal.pone.0189283openalex-snapshot
Optimal shortening of uniform covering arrays
inferred← citeshttps://doi.org/10.1515/dma-2020-0025openalex-snapshot
Attribute-efficient learning of Boolean functions from Post closed classes
inferred← citeshttps://doi.org/10.1587/transfun.2021eap1071openalex-snapshot
An Improved Adaptive Algorithm for Locating Faulty Interactions in Combinatorial Testing
inferred← citeshttps://doi.org/10.20381/ruor-5542openalex-snapshot
Graph-dependent Covering Arrays and LYM Inequalities
inferred← citeshttps://doi.org/10.20381/ruor-5890openalex-snapshot
Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing
inferred← citeshttps://doi.org/10.30534/ijatcse/2019/31862019openalex-snapshot
Review of Combinatorial Testing Strategy
inferred← citeshttps://doi.org/10.37236/2379openalex-snapshot
A Survey of Forbidden Configuration Results
inferred← citeshttps://doi.org/10.4213/dm1540openalex-snapshot
Параметро-эффективная расшифровка булевых функций из замкнутых классов Поста
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09287openalex-snapshot
Partial covering arrays for data hiding and quantization
inferred← citeshttps://doi.org/10.48550/arxiv.1703.05252openalex-snapshot
A Semi-Random Construction of Small Covering Arrays
inferred← citeshttps://doi.org/10.48550/arxiv.1901.02479openalex-snapshot
Non-uniform covering array with symmetric forbidden edge constraints
inferred← citeshttps://doi.org/10.4995/thesis/10251/17027openalex-snapshot
Constructing Covering Arrays using Parallel Computing and Grid Computing
inferred← citeshttps://doi.org/10.6028/nist.ir.7856openalex-snapshot
Applied and Computational Mathematics Division, Summary of Activities for Fiscal Year 2011
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.