Markov-Ketten
Gastredner: Alistair Sinclair
Humboldt-Universität zu Berlin, 7.-9. November 2002
Zeitplan:
Donnerstag, 7. November 2002(HU Berlin, Hauptgebäude, R. 2103) |
||
| 17:00 | A. Sinclair | Markov chain Monte Carlo algorithms (Teil 1) |
| 19:00 | gemeinsames Abendessen | |
Freitag, 8. November 2002(HU Berlin, Institut für Informatik, Humboldt-Kabinett) |
||
| 9:30 | A. Sinclair | Markov chain Monte Carlo algorithms (Teil 2) |
| 11:00 | D. Osthus | Finding large planar subgraphs |
| 11:45 | T. Voigt | On the chromatic number of the plane |
| 15:00 | V. Kaibel | Counting lattice triangulations in the plane |
| 16:00 | M. Kang | Efficient generation of random discrete objects: triangulations and outerplanar graphs |
| 20:00 | Philharmonie | |
Samstag, 9. November 2002(HU Berlin, Institut für Informatik, R. 4.101) |
||
| 10:00 | A. Sinclair | Markov chain Monte Carlo algorithms (Teil 3) |
| 11:30 | A. Coja-Oghlan | Algorithms for random and semirandom graph problems |
| 15:00 | S. Krumke | Non-Abusiveness Helps: A O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem |
| 15:45 | S. Felsner | Markov Chains for Linear Extensions |
Kontakt:
Dr. Anusch Taraz
Postanschrift Johann von Neumann-Haus Humboldt-Universität zu Berlin Institut für Informatik Rudower Chaussee 25 12489 Berlin
Tel. : (+49 30) 2093 3197 Fax : (+49 30) 2093 3191 e-mail : taraz@informatik.hu-berlin.de
English