13 citations · 16 across the 4 of their papers we have counts for
5 papers
Upper Bounds for Covering Arrays of Higher Index
Mason R. Calbert, Ryan E. Dougherty
A \emph{covering array} is an array of elements from a -ary alphabet such that every subarray contains all tuples from the alphabet of size a…
MIMOSA: Reducing Malware Analysis Overhead with Coverings
Mohsen Ahmadi, Kevin Leach, Ryan Dougherty +2
There is a growing body of malware samples that evade automated analysis and detection tools. Malware may measure fingerprints ("artifacts") of the underlying analysis tool or envi…
Distributing hash families with few rows
Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley
Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for…
Genetic Algorithms for Redundancy in Interaction Testing
Ryan E. Dougherty
It is imperative for testing to determine if the components within large-scale software systems operate functionally. Interaction testing involves designing a suite of tests, which…
Counting Subwords and Regular Languages
Charles J. Colbourn, Ryan E. Dougherty, Thomas F. Lidbetter +1
Let and be words. We consider the languages whose words are those for which the numbers of occurrences of and , as subwords of , are the same (resp., the numb…