Alan Hartman, Andrei Kirshin, et al.
SEAPP 2002
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution. © 2004 Elsevier B.V. All rights reserved.
Alan Hartman, Andrei Kirshin, et al.
SEAPP 2002
Alan Hartman, Alexander Rosa
European Journal of Combinatorics
Arun Sharma, G.R. Gangadharan, et al.
SOLI 2011
Haim Hanani, Alan Hartman, et al.
Discrete Mathematics