[ University of Bonn | Department of Computer Science | Chair V ]


Randomized and Approximate Computation

Oxford, 10-12th December 2003


RAND-APX Workshop

Lund, 25-26th April 2003


Randomized and Approximation Algorithms

Paris, 3-5th April 2002


Design and Analysis of Randomized and Approximation Algorithms (RAND-APX) Workshop

Dagstuhl, 3-8th June 2001


Randomized and Approximate Computation (RAND-APX) Workshop

http://www.dcs.ed.ac.uk/home/mrj/RAND-APXworkshop/RAND2_logo

International Centre for Mathematical Sciences

Edinburgh, 17-19th September 2000




 
 






Randomized Algorithms Workshop

Merton College, Oxford

Sunday 19 September - Wednesday 22 September 1999

Programme

Monday

8.15 - 8.45 Breakfast
 
9.15 - 9.55 Marek Karpinski
Randomized complexity of linear arrangements and polyhedra
 
10.00 - 10.40 Marc Noy
Random chord diagrams
 
10:45 Coffee in Hall
 
11.20 - 12.00 Jeff Sanders
Quantum programming
 
12.05 - 12.35 Miklos Santha
Self-testing of one-qubit gates
 
1.00 Lunch in Hall
 
2.15 - 2.45 Andrew Thomason
Complete minors and random graphs
 
2.50 - 3.20 Jesper Jansson
The Hamming center problem
 
3.25 - 3.55 Mikael Hammer
Online strategies for time dependent TSP
 
4.00 Tea in Hall
 
4.45 - 5.35 Roland Haeggkvist
On the Ising model
 
7.00 Reception in New Common Room
 
7.30 Dinner in Hall
 
 

Tuesday

8.15 - 8.45 Breakfast
 
9.15 - 9.55 Hans-Juergen Proemel
Asymptotic enumeration, global structure, and constrained evolution
 
10.00 - 10.40 D. B. Penman
Random graphs with correlation structure
 
10.45 Coffee in Hall
 
11.20 - 12.00 Graham Brightwell
Geometry and partial orders
 
12.05 - 12.45 Paul Fearnhead
Perfect simulation from the ancestral selection graph
 
1.00 Lunch in Hall
 
2.15 - 2.55 Neil O'Connel
Directed percolation and tandem queues
 
3.00 - 3.40 Imre Leader
Paths and directed paths in the cube
 
4.00 Tea in Hall
 
4.45 - 5.15 Jean-Guy Penaud
Tirage des arbres a pile ou face
 
5.20 - 5.50 Leslie Ann Goldberg
Learning evolutionary trees
 
7.30 Dinner in Hall
 
 

Wednesday

8.15 - 8.45 Breakfast
 
9.20 - 10.00 Angelika Steger
Balls-and-bins
 
10.05 - 10.35 Martin Dyer
Binary constraint satisfaction
 
10.45 Coffee in Hall
 
11.20 - 11.50 Mark Jerrum
Counting unlabelled subtrees of a tree is #P-complete
 
11.55 - 12.35 Robert Leese
Random problems in ratio channel assignment
 
1.00 Lunch in Hall


Last updated: February 5th, 2001

© InfoV -> webmaster