THIS SITE

Information for

Events

Friday, December 14, 2007 — 3:30 PM to 4:30 PM EST

Electrical Networks, Random Spanning Trees, and Correlation Inequalities

Speaker: David Wagner Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, December 7, 2007 — 3:30 PM to 4:30 PM EST

Gradient Methods for Minimizing Composite Objective Function

Speaker: Yurii Nesterov Affiliation: Catholic University of Louvain Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, November 30, 2007 — 3:30 PM to 4:30 PM EST

The Resolution Complexity of Random Constraint Satisfaction Problems

Speaker: Mike Molloy Affiliation: University of Toronto Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, November 23, 2007 — 3:30 PM to 4:30 PM EST

Greedy Algorithms and Complexity for Nonnegative Matrix Factorization

Speaker: Steve Vavasis Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, November 16, 2007 — 3:30 PM to 4:30 PM EST

New Nonlinear Functions for S-Boxes in Cryptography and their Fourier Transform

Speaker: Gary McGuire Affiliation: University College Dublin Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, November 9, 2007 — 3:30 PM to 4:30 PM EST

Are Most Graphs Determined by their Spectrum?

Speaker: Chris Godsil Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

The spectrum of a graph is the spectrum of its adjacency matrix. We will discuss the question raised in the title. At this point it is not even clear what the right conjecture is.

Friday, November 2, 2007 — 3:30 PM to 4:30 PM EDT

The Direct-Product Property, Subdistribution Bounds, and Applications

Speaker: Ashwin Nayak Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, October 26, 2007 — 3:30 PM to 4:30 PM EDT

Counting Unrooted Maps and Convex Polyhedra

Speaker: Hristo Sendov Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, October 19, 2007 — 3:30 PM to 4:30 PM EDT

Group-Strategy Proof Mechanisms for Network Design Games

Speaker: Jochen Könemann Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, October 12, 2007 — 3:30 PM to 4:30 PM EDT

On the Tunçel Conjecture: A New Class of Self-Concordant Barriers on Sets of Symmetric Matrices

Speaker: Hristo Sendov Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, October 5, 2007 — 3:30 PM to 4:30 PM EDT

The k-Linkage Problem for Graphs

Speaker: Jim Geelen Affiliation: University of Waterloo Room: Mathematics & Computer Building (MC) 5158

Abstract:

Friday, September 28, 2007 — 3:30 PM to 4:30 PM EDT

Optimal Quantum Adversary Lower Bounds for Ordered Search

Speaker: Andrew Childs Affiliation: University of Waterloo Room: Mathematics and Computer Building (MC) 5158

Abstract:

Friday, September 21, 2007 — 3:30 PM to 4:30 PM EDT

Tableaux, Puzzles and Mosaics

Speaker: Kevin Purbhoo Affiliation: University of Waterloo Room: Mathematics and Computer Building (MC) 5158

Abstract:

Friday, September 14, 2007 — 3:30 PM to 4:30 PM EDT

Width Parameters of Graphs and Codes, and Tree Tensor Networks

Speaker: Maarten can den Nest Affiliation: Institute for Quantum Optics and Quantum Information Room: Mathematics & Computer Building (MC) 5158

Abstract

Monday, June 18, 2007 (all day) to Saturday, June 23, 2007 (all day)

In celebration of the 40th anniversary of the department, and the 50th anniversary of the university, the Department of Combinatorics and Optimization at the University of Waterloo hosted a six day conference June 18-23, 2007. The theme focussed on the six main research areas represented by the department: algebraic combinatorics; combinatorial optimization; continuous optimization; cryptography; graph theory; and quantum computing. The goal of the conference was to encourage and stimulate both further research within these areas, and cross-discipline interaction.

S M T W T F S
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
  1. 2017 (59)
    1. August (1)
    2. July (4)
    3. June (9)
    4. May (10)
    5. April (7)
    6. March (13)
    7. February (10)
    8. January (5)
  2. 2016 (137)
    1. December (5)
    2. November (12)
    3. October (10)
    4. September (8)
    5. August (12)
    6. July (15)
    7. June (14)
    8. May (16)
    9. April (8)
    10. March (18)
    11. February (11)
    12. January (8)
  3. 2015 (136)
  4. 2014 (88)
  5. 2013 (48)
  6. 2012 (39)
  7. 2011 (36)
  8. 2010 (40)
  9. 2009 (40)
  10. 2008 (39)
  11. 2007 (15)
    1. December (2)
    2. November (5)
    3. October (4)
    4. September (3)
    5. June (1)