Friday, April 25


9.30  A probabilistic model and algorithms for evolution of genes by
      duplications (invited talk), Jens Lagergren, KTH Stockholm.

10.30 Coffee break

11    Elementary bounds on Poincar\'e and log-Sobolev constants
      for decomposable Markov chains, Mark Jerrum
     (joint work with Jung-Bae Son, Prasad Tetali and Eric Vigoda),
      Edinburgh.

11.30 Sampling colorings of the grid, Leslie Ann Goldberg 
      (joint work with Russ Martin and Mike Paterson), Edinburgh.


12 Lunch


13.30 Approximating Random Instances of MAX-3SAT, Marek Karpinski
      (joint work with W. Fernandez de la Vega), Bonn.

14    Approximation Schemes for Metric Minimum Bisection and Partitioning
      W. Fernandez de la Vega (joint work with Marek Karpinski and
       Claire Kenyon) CNRS, Orsay

14.30 Coffee break

15    On the  of Non-Approximability of the Tutte  Polynomial,
      Dominic Welsh, Oxford.  

15.30 Approximating Longest Directed Path, Andreas Bj\"orklund  
      (joint work with Thore Husfeldt and Sanjeev Khanna), Lund.


16-17 Meeting of the RAND-APX sites leaders


Saturday


9.30  Uniform Hashing in Constant Time and Linear Space,
      Rasmus Pagh (joint work with  Anna Östlin), IT Copenhagen

10    Novel Architectures for P2P Applications: 
      the Continuous-Discrete Approach 
      (joint work with with Udi Wieder), 
      Moni Naor, Weizmann Institute

10.30 Coffee break

11    Hidden Translation and Orbit Coset in Quantum Computing, 
      Miklos Santha (joint work with G. Ivanyos, K. Friedl, 
      F. Magniez and P. Sen) LRI, Orsay

11.30 Utilitarian Link Assignment, Russell Martin,
      (joint work with Petra Berenbrink, Leslie Ann Goldberg
      and Paul Goldberg), Edinbourgh.

12    Chips on Wafers, or Packing Rectangles into Grids, Mattias Andersson
      (joint work with Joachim Gudmundsson and Christos Levcopoulos)
      Lund.

12.30 Light lunch