Date 
Speaker 
Title 
Host 
Sept 14, 2007 
Maarten van den Nest
Institute for Quantum Optics and Quantum Information 
Width Parameters of Graphs and Codes, and
Tree Tensor Networks

SangIl Oum 
Sept 21, 2007 
Kevin Purbhoo
University of Waterloo 
Tableaux, Puzzles and Mosaics 

Sept 28, 2007 
Andrew Childs
University of Waterloo 
Optimal Quantum Adversary Lower Bounds for
Ordered Search 

Oct 5, 2007 
Jim Geelen
University of Waterloo 
The kLinkage Problem for Graphs 

Oct 12, 2007 
Hristo Sendov
University of Western Ontario 
On the Tunçel Conjecture: A New Class of
SelfConcordant Barriers on Sets of Symmetric Matrices 
Levent Tunçel 
Oct 19, 2007 
Jochen Könemann
University of Waterloo 
GroupStrategy Proof Mechanisms for Network
Design Games 

Oct 26, 2007 
Nick Wormald
University of Waterloo 
Counting Unrooted Maps and Convex Polyhedra 

Nov 2, 2007 
Ashwin Nayak
University of Waterloo 
The DirectProduct Property, Subdistribution Bounds,
and Applications 

Nov 9, 2007 
Chris Godsil
University of Waterloo 
Are Most Graphs Determined by their Spectrum? 

Nov 16, 2007 
Gary McGuire
University College Dublin 
New Nonlinear Functions for SBoxes in
Cryptography and their Fourier Transform 
Alfred Menezes 
Nov 23, 2007 
Steve Vavasis
University of Waterloo 
Greedy Algorithms and Complexity for Nonnegative Matrix
Factorization 

Nov 30, 2007 
Mike Molloy
University of Toronto 
The Resolution Complexity of Random Constraint Satisfaction
Problems 
Nick Wormald 
Dec 7, 2007 
Yurii Nesterov
Catholic University of Louvain 
Gradient Methods for Minimizing Composite Objective
Function 
Levent Tunçel 
Dec 14, 2007 
David Wagner
University of Waterloo 
Electrical Networks, Random Spanning Trees, and Correlation
Inequalities 
