Covering arrays of strength 3

Donald L. Kreher
Department of Mathematical Sciences
Michigan Technological University, Houghton


A covering array of size N, degree k, order v and strength t is a k by N array with entries from a set of v symbols such that in any t by N subarray every t by 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing.

About the Speaker

Dr. Kreher obtained his PhD from the University of Nebraska in 1984. He has held academic positions at Rochester Institute of Technology, University of Wyoming and Michigan Technological University. Dr. Kreher has published numerous research papers in the areas of combinatorics and combinatorial algorithms. He serves on the editorial boards of two journals. He is the recipient of the 1995 Marshall Hall Medal, awarded by the Institute of Combinatorics and its Applications.

Colloquia Series page.