CSI7160 Advanced topics in the theory of computing APPLICATIONS OF COMBINATORIAL DESIGNS IN COMPUTER SCIENCE Professor Lucia Moura http://www.site.uottawa.ca/~lucia/ email lucia@eecs.uottawa.ca Lectures: 11:30-14:30 WLD103 Objectives: To learn the main tools in the fields of combinatorial design theory and how they apply to many practical problems in computing, information technology and other fields. To gain an in-depth understanding of combinatorial design techniques to exposure to modern topics of research in design theory and in particular application problems of your interest. Course topics: 1) Basic combinatorial designs and constructions (block designs, Steiner triple systems, t-designs, Latin squares, orthogonal arrays, finite geometries, and others) and computer science (secret sharing, authentication codes, covering arrays and software testing, group testing and other selected computer science applications, etc) References and Textbooks: For the theory: Main textbook: Doug Stinson, Combinatorial Designs: Theory and Analysis, 2004. Other references to be recommended. For applications: A selection of research articles and book chapters. Marking scheme: 30% 3 assignments 30% 2 midterm tests 10% 1 paper review and presentation (due after reading week) 30% final project