May 14-16, 2006
Workshop on Covering arrays: constructions, applications and generalizations
held at Carleton University, Ottawa
Herzberg Building, room: 4351

Schedule (Abstracts)

Sunday May 14
9:00-9:20
Coffee and registration
9:20- 9:30 Opening remarks
9:30-10:30 Brett Stevens, Carleton University
Covering Arrays and their Generalizations
10:30-11:00 Coffee break
11:00-11:25

11:30-11:55

Anant P. Godbole, East Tennessee State University
Partial Covering Arrays and a Generalized Erdos-Ko-Rado Property
Lucia Moura,  University of Ottawa
Covering Arrays and Extremal Set-Partition System
12:00-2:00 Lunch
2:00-3:00 Charles Colbourn, Arizona State University
Construction Techniques for Covering Arrays
3:00-3:30 Coffee break
3:30-3:55

4:00-4:25

4:30-4:55

Joe Yucas, Southern Illinois University
Some covering arrays of strength two
Daniel Panario, Carleton University
Division of Trinomials by Pentanomials and Orthogonal Arrays
George Sherwood, Testcover.com LLC
A Column Expansion Construction for Optimal and Near-Optimal Mixed Covering Arrays
5:00 RECEPTION
Monday May 15
9:30-10:30 Alan Hartman, IBM Haifa Research Laboratory
Covering arrays: Mathematical, Engineering, and Scientific Perspectives
10:30-11:00 Coffee break
11:00-11:25


11:30-12:00

Yu Lei, University of Texas at Arlington
Combinatorial Testing using Covering Arrays: Going beyond Pairwise Testing
Myra Cohen, University of Nebraska - Lincoln
Variable Strength Covering Arrays: Applications and Challenges
12:00-2:00
Lunch
2:00-2:25
Roy Gourgi,
Covering designs - a new approach
2:30-4:00 Peter Gibbons, The University of Auckland
Computational Constructions of Combinatorial Structures
4:00
Walk to Dow's Lake: Tulip viewing and Mexican pub
Tuesday May 16
9:00-10:30 Doug R.Stinson, University of Waterloo
A Tutorial on Orthogonal Arrays: Constructions, Bounds and Links to Error-correcting Codes
10:30-11:00 Coffee break
11:00-11:25

11:30-11:55

Robert F. Bailey, Queen Mary, University of London
Uncoverings-by-bases for Groups and Matroids
Frank E. Bennett, Mount Saint Vincent University
Perfect Mendelsohn Designs: A Brief Survey of Existence Results
12:00-1:30 Lunch
1:30-3:00 Rick Brewster, Thompson Rivers University
Tutorial: Graph Homomorphisms, an introduction
3:00-3:30
Coffee break
3:30-3:50

4:00-4:25

Latifa Zekaoui, University of Ottawa
Mixed Covering Arrays on Graphs
Jason Lobb, Carleton University
TBA

Top