On the public citation graph
Asymptotic Size of Covering Arrays: An Application of Entropy Compression
0 signed · 42 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.20065openalex-snapshot
Products of mixed covering arrays of strength two
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/s00493-015-3070-6openalex-snapshot
Nonrepetitive colouring via entropy compression
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/s10623-008-9235-1openalex-snapshot
Covering arrays of strength 3 and 4 from holey difference matrices
inferredcites →https://doi.org/10.1007/s10623-011-9505-1openalex-snapshot
Constructions of covering arrays of strength five
inferredcites →https://doi.org/10.1016/0012-365x(73)90098-8openalex-snapshot
Families of k-independent sets
inferredcites →https://doi.org/10.1016/j.disc.2003.11.029openalex-snapshot
Problems and algorithms for covering arrays
inferredcites →https://doi.org/10.1016/j.jcta.2009.06.002openalex-snapshot
Constructions of new orthogonal arrays and covering arrays of strength three
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/15598608.2012.647489openalex-snapshot
Improving Two Recursive Constructions for Covering Arrays
inferredcites →https://doi.org/10.1109/icsm.2011.6080840openalex-snapshot
Practical combinatorial (t-way) methods for detecting complex faults in regression testing
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
inferredcites →https://doi.org/10.1145/1824795.1824796openalex-snapshot
Protein-to-protein interactions
inferredcites →https://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferredcites →https://doi.org/10.1145/253228.253271openalex-snapshot
Applying design of experiments to software testing
inferredcites →https://doi.org/10.20381/ruor-19660openalex-snapshot
Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory
inferredcites →https://doi.org/10.48550/arxiv.1405.2844openalex-snapshot
Covering Array Bounds Using Analytical Techniques
inferredcites →https://doi.org/10.48550/arxiv.1406.4380openalex-snapshot
Entropy compression method applied to graph colorings
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.21659openalex-snapshot
Covering arrays for some equivalence classes of words
inferred← citeshttps://doi.org/10.1002/jcd.21671openalex-snapshot
On the structure of small strength‐2 covering arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_34openalex-snapshot
Partial Covering Arrays: Algorithms and Asymptotics
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_29openalex-snapshot
Separating Interaction Effects Using Locating and Detecting Arrays
inferred← citeshttps://doi.org/10.1007/s10623-017-0369-xopenalex-snapshot
Asymptotic and constructive methods for covering perfect hash families and covering arrays
inferred← citeshttps://doi.org/10.1007/s11786-018-0385-xopenalex-snapshot
On a Combinatorial Framework for Fault Characterization
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.aam.2021.102163openalex-snapshot
Entropy compression versus Lovász Local Lemma
inferred← citeshttps://doi.org/10.1016/j.endm.2018.02.019openalex-snapshot
The Lovász Local Lemma and Variable Strength Covering Arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.022openalex-snapshot
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
inferred← citeshttps://doi.org/10.1049/iet-sen.2017.0107openalex-snapshot
Improved pairwise test suites for non‐prime‐power orders
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654003openalex-snapshot
A Remark on Downlink Massive Random Access
inferred← citeshttps://doi.org/10.1137/16m1067767openalex-snapshot
Upper Bounds on the Size of Covering Arrays
inferred← citeshttps://doi.org/10.2139/ssrn.6172504openalex-snapshot
Existence of 3 anti-cocircular truncated Möbius planes and constructions of strength-4 covering arrays
inferred← citeshttps://doi.org/10.4171/aihpd/122openalex-snapshot
Moser–Tardos resampling algorithm, entropy compression method and the subset gas
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.1803.06507openalex-snapshot
Covering Arrays for Equivalence Classes of Words
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.