Tentative program

"Combinatorics, probability and algorithms"

to be held at the CRM in Montreal
May 5-23, 2003

Week 1
Monday, May 5
Tuesday, May 6
Wednesday, May 7
Thursday, May 8
10:00-11:00
V. Chvátal:
Solving the Travelling Salesman Problem I
V. Chvátal:
Solving the Travelling Salesman Problem II
V. Chvátal:
Solving the Travelling Salesman Problem III
V. Chvátal:
Solving the Travelling Salesman Problem IV
11:30-12:30
A. Frieze:
Threshold phenomena I
A. Frieze:
Threshold phenomena II
A. Frieze:
Threshold phenomena III
A. Frieze:
Threshold phenomena IV
14:00-15:00
A. Soshnikov
On the largest eigenvalue of a random subgraph of the hypercube
N. Wormald:
15:30-16:30
N. Alon:
Probabilistic reasoning


Week 2
Monday, May 12
Tuesday, May 13
Wednesday, May 14
Thursday, May 15
10:00-11:00
G. Lugosi:
Concentration Inequalities I
G. Lugosi:
Concentration Inequalities III
L. Lovász:
Sampling, Mixing, and Markov Chains II
L. Lovász:
Sampling, Mixing, and Markov Chains III
11:30-12:30
G. Lugosi:
Concentration Inequalities II
G. Lugosi:
Concentration Inequalities IV
L. Lovász:
Sampling, Mixing, and Markov Chains IV
14:00-15:00
Ram Murty:
Ramanujan Graphs
M. Chudnosvsky:
A proof of the strong perfect graph conjecture
15:30-16:30
L. Lovász:
Sampling, Mixing, and Markov Chains I


Week 3
Tuesday, May 20
Wednesday, May 21
Thursday, May 22
Friday, May 23
10:00-11:00
J. Pach:
Geometric Graph Theory I
J. Pach:
Geometric Graph Theory II
J. Pach:
Geometric Graph Theory III
J. Pach:
Geometric Graph Theory IV
11:30-12:30
I. Bárány:
Combinatorial Geometry I
I. Bárány:
Combinatorial Geometry II
I. Bárány:
Combinatorial Geometry III
I. Bárány:
Combinatorial Geometry IV
14:00-15:00
E. Szemerédi:
Long arithmetic progressions and the number of x-sum free sets
E. Szemerédi:
On the number of monochromatic solutions of x2+ y2 = z2
15:30-16:30
E. Szemerédi:
On the regularity method

April 23, 2003
Webmaster