2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2019
Non-uniform covering array with symmetric forbidden edge constraints
Brett Stevens
It has been conjectured that whenever an optimal covering array exists there is also a uniform covering array with the same parameters and this is true for all known optimal coveri…
math.CO2019
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
Lucia Moura, Sebastian Raaphorst, Brett Stevens
Covering arrays are generalizations of orthogonal arrays that have been widely studied and are used in software testing. The probabilistic method has been employed to derive upper…
math.CO2016★ 2 cited
A note on Beckett-Gray codes and the relationship of Gray codes to data structures
Mark Cooke, Chris North, Megan Dewar +1
In this paper we introduce a natural mathematical structure derived from Samuel Beckett's play "Quad". We call this structure a binary Beckett-Gray code. We enumerate all codes for…