RAND-APX Workshop, ICMS Edinburgh: Provisional Programme
Sunday 17th September
- 10:00-12:30. Contributed talks.
- 12:30-14:00. Lunch.
- 14:00-15:00.
Andrew Stuart, University of Warwick: ``Algorithms for collision
detection amongst spheres'' (invited talk)
- 11:30-12:00.
Malwina Luczak, University of Oxford, UK:
``Optimal data arrangement in a tree directory''
- 12:30.
Lunch (hot buffet).
- 14:30-15:00.
Roni Khardon, University of Edinburgh, UK:
``On Learning Read-k-Satisfy-j DNF''
- 15:00-15:30.
Artur Czumaj, Heinz Nixdorf Institute, Paderborn, Germany:
``Delayed path coupling and its applications''
- 15:30-16:00. Tea
- 16:00-16:30.
Catherine Greenhill, University of Leeds, UK:
``A genuinely polynomial-time algorithm for sampling two-rowed
contingency tables''
- 16:30-17:00.
Yann Verhoeven, Université Paris-Sud, France:
``Random 2SAT and unsatisfiability''
Saturday 28th March
- 09:30-10:30. Invited talk.
Michel Goemans, Université Catholique de Louvain, Belgium,
and MIT, USA:
``Randomized embeddings of metrics''
- 10:30-11:00. Coffee
- 11:00-11:40. Marek Karpinski, Universität Bonn, Germany:
``Some upper and lower bounds on randomzed branching programs''
- 11:40-12:10.
Marta Kwiatkowska, University of Birmingham, UK:
``On probabilistic model checking''
- 12:30. Lunch (cold buffet).
- 14:30-15:00.
Mathew Penrose, University of Durham, UK:
``Minimal spanning trees on random points''
- 15:00-15:30.
Miklos Santha, Université Paris-Sud, France:
``Testing approximate linearity with relative
errors over finite rational domains''
- 15:30-16:00. Tea
- 16:00-16:30.
Andrzej Lingas, Lund University, Sweden:
``Bounds on constructing phylogenetic trees using
balanced randomized splitting''
- 16:30-17:00.
Mary Cryan, University of Warwick, UK:
``Learning generalized Cavender-Farris trees''
Sunday 29th March
- 09:30-10:30. Invited talk.
Ravindran Kannan, Yale University, USA:
``Fast approximate singular value decomposition of a matrix''
- 10:30-11:00. Coffee
- 11:00-11:45.
Jürgen Wirtgen, Universität Bonn, Germany:
``On approximation intractability of the bandwidth problem''
- 11:45-12:15.
Wenceslas Fernandez de la Vega, Université Paris-Sud, France:
``On approximation hardness of dense TSP and other path problems''
Mark Jerrum
Last modified: Fri Sep 1 11:02:49 BST 2000