|
CMPW01 |
5th August 2002
11:30 to 12:30 |
S Janson |
Estimates for large deviations of sums of dependent variables |
|
CMPW01 |
5th August 2002
14:00 to 15:00 |
|
Reimer's inequality and a conjecture of Tardos |
|
CMPW01 |
5th August 2002
16:00 to 17:00 |
|
Mixing time and its relation to other Markov chain parameters |
|
CMPW01 |
6th August 2002
10:00 to 11:00 |
|
Blocking Conductance --- an improved measure of convergence |
|
CMPW01 |
6th August 2002
11:30 to 12:30 |
|
The differential equations method |
|
CMPW01 |
6th August 2002
14:00 to 15:00 |
|
The distribution of values in the quadratic assignment problem |
|
CMPW01 |
6th August 2002
16:00 to 17:00 |
C Cooper |
The cover time of sparse random graphs $G_{n,p}$, $p=c \log n$, $c>1$, and related problems |
|
CMPW01 |
7th August 2002
10:00 to 11:00 |
|
Two-dimensional bootstrap percolation |
|
CMPW01 |
7th August 2002
11:30 to 12:30 |
|
Noise - insensitive Boolean - functions are juntas |
|
CMPW01 |
8th August 2002
10:00 to 11:00 |
P Tetali |
Approximating Min-sum set cover |
|
CMPW01 |
8th August 2002
11:30 to 12:30 |
|
Mixing in time and space for lattice spin system: a combinatorial view |
|
CMPW01 |
8th August 2002
14:00 to 15:00 |
|
Chromatic polynomials, Potts models, and all that |
|
CMPW01 |
8th August 2002
16:00 to 17:00 |
M Cryan |
A polynominal-time algorithm to approximately count contingency tables when the number of rows is constant |
|
CMPW01 |
9th August 2002
10:00 to 11:00 |
D Randall |
Random dyadic tilings of the unit square |
|
CMPW01 |
9th August 2002
11:30 to 12:30 |
M Mahoney |
Markov chan Monte Carlo in statistical physics \& an application to the statistical mechanics of simple models of liquid water |
|
CMPW01 |
9th August 2002
14:00 to 15:00 |
G Brightwell |
Connectedness of Glauber dynamics for H-coloring |
|
CMPW01 |
9th August 2002
16:00 to 17:00 |
|
Mixing \& shuffling |
|
CMPW01 |
12th August 2002
10:00 to 11:00 |
T Gowers |
Arithmetic progressions and Fourier analysis |
|
CMPW01 |
12th August 2002
11:30 to 12:30 |
|
Clifford algebras and approximating the permanent |
|
CMPW01 |
12th August 2002
14:00 to 15:00 |
|
The compexity of sampling (and approximately counting graph homomorphism |
|
CMPW01 |
12th August 2002
16:00 to 17:00 |
|
Approximate counting by dynamic programming |
|
CMPW01 |
13th August 2002
10:00 to 11:00 |
|
The Poisson cloning model for random graphs with applications to k-core problems, random 2-SAT, and random digraphs |
|
CMPW01 |
13th August 2002
11:30 to 12:30 |
|
(Distance constrained) edge packing in random regular graphs |
|
CMPW01 |
13th August 2002
14:00 to 15:00 |
|
Ramsey properties of random structures |
|
CMPW01 |
13th August 2002
16:00 to 17:00 |
|
Discrete smoothed complexity |
|
CMPW01 |
14th August 2002
11:30 to 12:30 |
|
Hueristic algorithms for optimal directed spanning trees... |
|
CMPW01 |
15th August 2002
10:00 to 11:00 |
|
Existence of a perfect matching in a random (1 + 1/e)-out bipartite graph |
|
CMPW01 |
15th August 2002
11:30 to 12:30 |
|
Perfect matchings in random graphs with prescribed minimal degree |
|
CMPW01 |
15th August 2002
14:00 to 15:00 |
|
Building uniform subtrees of a Cayley tree |
|
CMPW01 |
15th August 2002
16:00 to 17:00 |
|
Phase transitions in random MAX 2-SAT and MAX CUT |
|
CMPW01 |
16th August 2002
10:00 to 11:00 |
|
On the possibility, and impossiblity, of interruptible perfect sampling |
|
CMPW01 |
16th August 2002
11:30 to 12:30 |
|
Simple strategies for high-precision load balancing |
|
CMPW01 |
16th August 2002
14:00 to 15:00 |
|
A stochastic process on the hypercube with applications to peer-to-peer networks |
|
CMPW01 |
16th August 2002
16:00 to 17:00 |
|
Approximating dense instances of MIN-SAT |
