Date |
Speaker |
Title |
Host |
May 8, 2009 |
David Jackson
University of Waterloo (adjunct) |
A quantum invariant of knots |
|
May 15, 2009 |
Ian Goulden
University of Waterloo |
Kerov's character polynomials and permutations |
|
May 22, 2009 |
Alan Frieze
Carnegie Mellon University |
The Karp-Sipser Matching Algorithm and Refinements
(Joint seminar with WaterMellon
Workshop) |
Nick Wormald |
May 29, 2009 |
David Jao
University of Waterloo |
Boneh-Boyen signatures and the Strong Diffie-Hellman problem |
|
Jun 5, 2009 |
No Seminar |
Jun 12, 2009 |
Arkadi Nemirovski
Georgia Tech |
Verifiable sufficient conditions in Compressed Sensing |
Levent Tunçel |
Jun 19, 2009 |
Daniel Gottesman
Perimeter Institute |
Computational Complexity of Translationally-Invariant Systems |
Andrew Childs |
Jun 26, 2009 |
Peter Winkler
Dartmouth College |
Scheduling, Percolation, and the Worm Order |
Penny Haxell |
Jul 3, 2009 |
Nick Wormald
University of Waterloo |
Load balancing and random graphs |
|
Jul 10, 2009 |
Jim Geelen
University of Waterloo |
Binary matroid minors |
|
Jul 17, 2009 |
Jochen Könemann
University of Waterloo |
On Generalizations of Network Design Problems with Degree Bounds |
|
Jul 24, 2009 |
Chris Godsil
University of Waterloo |
Awful Graphs |
|
Jul 31, 2009 |
Henry Wolkowicz
University of Waterloo |
Sensor Network Localization, Euclidean Distance Matrix
Completions, and Graph Realization |
|
Aug 7, 2009 |
No Seminar: seminar moved to August 14 |
Aug 14, 2009 |
Ben Reichardt
School of Computer Science, University of Waterloo |
Span programs and quantum query complexity |
Ashwin Nayak |
Aug 21, 2009 |
Yurii Nesterov
Catholic University of Louvain |
Efficiency of random search methods on huge-scale optimization
problems |
Levent Tunçel |