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 

Twodimensional 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 Minsum 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 polynominaltime 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 Hcoloring 
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 kcore problems, random 2SAT, 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 2SAT 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 highprecision load balancing 
CMPW01 
16th August 2002 14:00 to 15:00 

A stochastic process on the hypercube with applications to peertopeer networks 
CMPW01 
16th August 2002 16:00 to 17:00 

Approximating dense instances of MINSAT 
CMPW02 
27th August 2002 08:30 to 10:00 

Registration 
CMPW02 
27th August 2002 10:00 to 11:00 

Nearly solved models in statistical mechanics 
CMPW02 
27th August 2002 11:30 to 12:30 
A Stacey 
Percolation on finite graphs 
CMPW02 
27th August 2002 14:00 to 15:00 
A Thomason 
The extremal structure of graph minors 
CMPW02 
27th August 2002 16:00 to 17:00 

Subgaussian constant and concentration inequalities 
CMPW02 
28th August 2002 10:00 to 11:00 
D Galvin 
Homomorphisms from the Hamming cube to Z 
CMPW02 
28th August 2002 11:30 to 12:30 
B Pittel 
Phase diagram for the constrained integer partitioning problem 
CMPW02 
29th August 2002 10:00 to 11:00 

Phase transitions on trees and rapid mixing of Glauber dynamics on highgirth graphs 
CMPW02 
29th August 2002 11:30 to 12:30 

Archimedean ice 
CMPW02 
29th August 2002 14:00 to 15:00 

Spectral gap and logSobolev constant for balanced matroids 
CMPW02 
29th August 2002 16:00 to 17:00 

How to prove conditional randomness 
CMPW02 
30th August 2002 10:00 to 11:00 

Random quadrangulations and Brownian Snake 
CMPW02 
30th August 2002 11:30 to 12:30 

SOS and hard core models on a Cayley tree 
CMPW02 
30th August 2002 14:00 to 15:00 
O Hryniv 
Trees, walks and critical prewetting 
CMPW02 
30th August 2002 16:00 to 17:00 

On the largest eigenvalue of a random subgroup of the hypercube 
CMPW02 
2nd September 2002 11:30 to 12:30 
M Krivelevich 
Colouring problems in random graphs 
CMPW02 
2nd September 2002 14:00 to 15:00 

Martingale inequalities and the asymptotic behaviour of large communication networks 
CMPW02 
2nd September 2002 16:00 to 17:00 
S Janson 
Upper tails for subgraph counts in random graphs 
CMPW02 
3rd September 2002 10:00 to 11:00 

Random geometric graphs: cliques \& giant components 
CMPW02 
3rd September 2002 11:30 to 12:30 

Independent sets, lattice gases and the Lovasz Local Lemma 
CMPW02 
3rd September 2002 14:00 to 15:00 

Generalised acyclic edge colourings of random regular graphs 
CMPW02 
3rd September 2002 16:00 to 17:00 
C Cooper 
The size of the cores of random hypergraphs with a given degree sequence 
CMPW02 
4th September 2002 10:00 to 11:00 
E Mossel 
Mixing times of the biased card shuffling and the asymmetric exclusion process 
CMPW02 
4th September 2002 11:30 to 12:30 
D Stark 
Information loss in top to random shuffling 
CMPW02 
5th September 2002 10:00 to 11:00 

Colouring random graphs in expected polynomial time 
CMPW02 
5th September 2002 11:30 to 12:30 
C McDiarmid 
Random channel assignment problems 
CMPW02 
5th September 2002 14:00 to 15:00 

Quantum random walks 
CMPW02 
5th September 2002 16:00 to 17:00 

On the structure of the giant component of spares random graphs 
CMPW02 
6th September 2002 09:00 to 10:00 
A Stacey 
Percolation on finite graphs 
CMPW02 
6th September 2002 10:00 to 11:00 

Scalefree random graphs 
CMPW02 
6th September 2002 11:30 to 12:30 

On phase transition in the hardcore model on $Z^d$ 
CMPW02 
6th September 2002 14:00 to 15:00 

Phase transitions in hypergraph processes 
CMPW02 
6th September 2002 16:00 to 17:00 
M Karonski 
On graph irregularity strength 
CMP 
25th September 2002 14:00 to 15:00 

The phase transiton in random graphs: a microscopic view of the randomcluster model 
CMP 
26th September 2002 11:00 to 12:00 

On playing golf with two balls 
CMP 
2nd October 2002 16:00 to 17:00 

Incipient infinite percolation clusters in two and high dimensions 
CMP 
8th October 2002 14:00 to 15:00 

On a hypergraph extremal problem 
CMP 
15th October 2002 16:00 to 17:00 

Selfdestructive percolation 
CMP 
23rd October 2002 16:00 to 17:00 
A Lukacs 
Generating random group elements 
CMP 
29th October 2002 16:00 to 17:00 

Online optimisation 
CMP 
12th November 2002 16:00 to 17:00 

Simulated tempering: fast or slow? 
CMP 
19th November 2002 16:00 to 17:00 

NonMarkovian coupling 
CMP 
26th November 2002 16:00 to 17:00 

Markov chains for contingency tables with few rows 
CMP 
3rd December 2002 16:00 to 17:00 

Stochastic process methods in the analysis of random hypergraphs 
CMP 
10th December 2002 16:00 to 17:00 

Cyclic colourings and distant 2colourings of planar graphs 
CMPW03 
16th December 2002 10:00 to 11:00 

Congestion pricing and capacity expansion games 
CMPW03 
16th December 2002 11:30 to 12:30 

Games and computation 
CMPW03 
16th December 2002 14:00 to 15:00 
B Voecking 
Pricing equilibria for a congestion game with incomplete information 
CMPW03 
16th December 2002 15:30 to 16:00 

On the power of two choices: balls and bins in continous time 
CMPW03 
16th December 2002 16:00 to 17:00 

A model of directed scalefree graphs$^2$ 
CMPW03 
17th December 2002 10:00 to 11:00 

Understanding the internet graph 
CMPW03 
17th December 2002 11:30 to 12:30 

Coordination mechanisms 
CMPW03 
17th December 2002 14:00 to 15:00 

How intractable is the "invisible hand" 
CMPW03 
17th December 2002 15:30 to 16:00 
A Vetta 
On the quality of competitive equilibria in games with submodular social objective functions 
CMPW03 
17th December 2002 16:00 to 16:30 

Admission control and routing to parallel queues via Whittle's restless bandit index policy 
CMPW03 
17th December 2002 16:30 to 17:00 

Internet resource allocation and a network congestion game 
CMPW03 
18th December 2002 10:00 to 11:00 
P Raghavan 
Measurements on the web graph 
CMPW03 
18th December 2002 11:30 to 12:30 
C Cooper 
Web graphs: models and algorithms 
CMPW03 
18th December 2002 14:00 to 15:00 
A Karlin 
Competitive worstcase analysis of truthful auctions: a survey 
CMPW03 
18th December 2002 15:30 to 16:00 

Asymptotic properties of a simple TCP model 
CMPW03 
18th December 2002 16:00 to 16:30 

A limit process for longrange dependent arrival models under critical scaling 
CMPW03 
19th December 2002 10:00 to 11:00 

Network design with selfish agents 
CMPW03 
19th December 2002 11:30 to 12:30 

Selfish routing and the price of anarchy 
CMPW03 
19th December 2002 14:00 to 15:00 

Building lowdiameter peertopeer networks 
CMPW03 
19th December 2002 15:30 to 16:00 

Assessing routing behaviour into a shared resource: simulation vs. the Nash equilibrium 
CMPW03 
19th December 2002 16:00 to 17:00 

On REM and SAMestimation of congestion price using probabilistic packet marking 
CMPW03 
20th December 2002 10:00 to 11:00 

Dynamic routing on networks with fixedsize buffers 
CMPW03 
20th December 2002 11:30 to 12:30 
R Gibbens 
Fixed point models for performance engineering in enterprise IP networks 