| Worshop date and time: | June 16-18, 2008 |
| Location: | City University, Hong Kong |
| Organizers: | Peter Bürgisser, Paderborn, Germany. Mario Wschebor, Montevideo, Uruguay. |
Schedule
| June 16 | Slot 1 | 13:50 - 14:35 | Steve Zelditch (semiplenary) | Geometry and statistical patterns in zeros and critical points of random waves | Abstract | Slides |
| Slot 2 | 14:40 - 15:25 | Pascal Koiran | On the expressive power of planar perfect matching and permanents of bounded treewidth matrices | Abstract | Slides | |
| Slot 3 | 16:00 - 16:45 | Klaus Meer | On the expressive power of CNF formulas of bounded Tree- and Clique-Width | Abstract | Slides | |
| Slot 4 | 16:50 - 17:10 | Irenee Briquel (contributed) | Satisfaction constraint problems: an attempt to transpose a dichotomy theorem | Abstract | Slides | |
| 17:15 - 17:35 | Jean-Claude Yakoubsohn (contributed) | Complexity of the nearest GCD computation | Abstract | Slides | ||
| Slot 5 | 17:40 - 18:25 | Paulin de Naurois | Parallel Time and Quantifier Prefixes | Abstract | Slides | |
| June 17 | Slot 1 | 13:50 - 14:35 | Mike Shub | On the Geometry and Topology of the Solution Variety and the Complexity of Bezout's Theorem | Abstract | |
| Slot 2 | 14:40 - 15:25 | Jean-Piere Dedieu (semiplenary) | Complexity of Bezout's Theorem via the condition metric | Abstract | Slides | |
| Slot 3 | 16:00 - 16:45 | Carlos Beltrán | Complexity analysis of path-following methods for solving systems of polynomial equations | Abstract | ||
| Slot 4 | 16:50 - 17:35 | Gregorio Malajovich | The expected number of minima of a polynomial | Abstract | ||
| Slot 5 | 17:40 - 18:25 | Jan Verschelde | Certificates in Numerical Algebraic Geometry | Abstract | Slides | |
| June 18 | Slot 1 | 13:50 - 14:35 | Marc Giusti | Bipolar Varieties and Real Solving of Singular Algebraic Varieties | Abstract | Slides |
| Slot 2 | 14:40 - 15:25 | Felipe Cucker | A Numerical Algorithm for Zero Counting | Abstract | Slides | |
| Slot 3 | 16:00 - 16:45 | Shang-Hua Teng (semiplenary) | Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation | Abstract | Slides | |
| Slot 4 | 16:50 - 17:35 | Martin Lotz | Adversarial Smoothed Analysis of Condition Numbers | Abstract | Slides | |
| Slot 5 | 17:40 - 18:00 | Peter Scheiblechner (contributed) | Counting Irreducible Components of Complex Algebraic Varieties | Abstract | Slides | |
| 18:05 - 18:25 | Dennis Amelunxen (contributed) | Uniform Smoothed Analysis of a Condition Number for Linear Programming | Abstract | Slides | ||