Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Friday, December 5, 2008 — 3:30 PM to 4:30 PM EST
Continuity of quantum channel capacities
Speaker: Debbie Leung Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, November 28, 2008 — 3:30 PM to 4:30 PM EST
Constructing expander graphs from the Generalized Riemann Hypothesis
Speaker: David Jao Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, November 21, 2008 — 3:30 PM to 4:30 PM EST
Packing Element-Disjoint Steiner Trees
Speaker: Joseph Cheriyan Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, November 14, 2008 — 3:30 PM to 4:30 PM EST
On the chromatic number of random d-regular graphs
Speaker: Nick Wormald Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, November 7, 2008 — 3:30 PM to 4:30 PM EST
Terminal Backup, 3D Matching and Covering Cubic Graphs
Speaker: Elliot Anshelevich Affiliation: Rensselaer Polytechnic Institute Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, October 31, 2008 — 3:30 PM to 4:30 PM EDT
Binary matroid minors
Speaker: Jim Geelen Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
In joint work with Bert Gerards and Geoff Whittle, we have proved a structural characterization for minor-closed classes of binary matroids. I will give a brief description of the theorem and discuss potential applications.
Friday, October 24, 2008 — 3:30 PM to 4:30 PM EDT
Well-quasi-ordering tournaments and Rao's degree-sequence conjecture
Speaker: Paul Seymour Affiliation: Princeton University Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, October 17, 2008 — 3:30 PM to 4:30 PM EDT
Isomorphism theorems for even cycles and even cuts in graphs
Speaker: Bertrand Guenin Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, October 10, 2008 — 3:30 PM to 4:30 PM EDT
Recent developments in spectral graph theory
Speaker: Sebi Cioaba Affiliation: University of Toronto Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, October 3, 2008 — 3:30 PM EDT
On the Complexity of Game and Market Equilibria
Speaker: Shang-Hua Teng Affiliation: Boston University Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, September 26, 2008 — 3:30 PM to 4:30 PM EDT
Perfect state transfer on graphs
Speaker: Chris Godsil Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, September 19, 2008 — 3:30 PM to 4:30 PM EDT
Approximation algorithms for envy-free profit-maximization problems
Speaker: Chaitanya Swamy Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, September 12, 2008 — 3:30 PM to 4:30 PM EDT
Combinatorial reasoning in Information Theory
Speaker: Noga Alon Affiliation: Tel Aviv University and IAS, Princeton Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, September 5, 2008 — 3:30 PM to 4:30 PM EDT
Gray codes, universal cycles, and the cool-lex order
Speaker: Aaron Williams Affiliation: University of Victoria Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, August 22, 2008 — 3:30 PM to 4:30 PM EDT
Bit Security of Elliptic Curve Diffie-Hellman Secret Keys
Speaker: Dimitar Jetchev Affiliation: Institut des Hautes Études Scientifiques Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, August 1, 2008 — 3:30 PM to 4:30 PM EDT
On the structure of binary matroids
Speaker: Jacques Verstraete Affiliation: University of California, San Diego Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, July 25, 2008 — 3:30 PM to 4:30 PM EDT
One-More Discrete Logarithm Problems
Speaker: Alfred Menezes Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
There are many issues that arise in interpreting reductionist proofs of security of cryptographic protocols. I will consider the case of security proofs that rely on the hardness of non-standard one-more discrete logarithm and Diffie-Hellman problems.
Friday, July 18, 2008 — 3:30 PM to 4:30 PM EDT
One-More Discrete Logarithm Problems
Speaker: Andrew Childs Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, July 11, 2008 — 3:30 PM to 4:30 PM EDT
On the structure of binary matroids
Speaker: Bert Gerards Affiliation: CWI, Netherlands Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, July 4, 2008 — 3:30 PM to 4:30 PM EDT
Duality, Complementarity, and Regularization, in Conic Convex Optimization
Speaker: Henry Wolkowicz Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, June 27, 2008 — 3:30 PM to 4:30 PM EDT
Scarf's Lemma and the Stable Paths Problem
Speaker: Penny Haxell Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, June 20, 2008 — 3:30 PM to 4:30 PM EDT
Matroid representation over the reals
Speaker: Geoff Whittle Affiliation: Victoria University of Wellington Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, June 13, 2008 — 3:30 PM to 4:30 PM EDT
Key establishment - goals, security arguments and applications
Speaker: Berkant Ustaoglu Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, June 6, 2008 — 3:30 PM to 4:30 PM EDT
Random colorings of graphs
Speaker: Juan Vera Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract:
Friday, May 30, 2008 — 3:30 PM to 4:30 PM EDT
On the Maximum of the Stirling Numbers
Speaker: Bruce Richmond Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158Abstract: