TUESDAY, AUGUST 22, 2006 |
|
| 09:30 - 10:00 | Registration and Reception |
| 10:00 - 10:10 | Welcome and Opening Remarks |
| 10:10 - 11:00 | Stathis Zachos (NTUA) Hierarchies of Complexity Classes |
| 11:00 - 11:40 | Vangelis Markakis (Toronto) On the Fourier Spectrum of Symmetric Boolean Functions (with applications to learning symmetric juntas) |
| 11:40 - 12:00 | Coffee break |
| 12:00 - 12:40 | Michael Lampis (NTUA) On the Relation between Vehicle Scheduling and Path Coloring |
| 12:40 - 13:20 | Euripides Markou (UoA) Mobile Agent Rendezvous in Graphs |
| 13:20 - 14:00 | Spyridon Antonakopoulos (Columbia) Fast Leader-Election Protocols with Bounded Cheaters' Edge |
| 14:00 - 16:00 | Lunch break - Free time |
| 16:00 - 16:50 | Dimitris Achlioptas (UC Santa Cruz) Applications of Random Matrices to Spectral Computations and Machine Learning |
| 16:50 - 17:30 | Katerina Potika (NTUA) Optimization Problems in Multifiber Optical Networks |
| 17:30 - 17:50 | Coffee break |
| 17:50 - 18:30 | George Kollios (Boston) Norm, Point, and Distance Estimation Over Multiple Signals Using Max-Stable Distributions |
| 18:30 - 19:10 | Elias P. Tsigaridas (UoA) On the Complexity of Polynomial Real Solving |
| 19:10 - 20:00 | Elias Koutsoupias (UoA) On Mechanisms for Scheduling on Unrelated Machines |
| 20:30 - | Conference dinner |
WEDNESDAY, AUGUST 23, 2006 |
|
| 10:10 - 11:00 | Vassilis Zissimopoulos (UoA) Dynamic Graph Problems and Algorithms |
| 11:00 - 11:40 | Costis Daskalakis (UC Berkeley) Optimal Phylogenetic Reconstruction |
| 11:40 - 12:00 | Coffee break |
| 12:00 - 12:40 | Ioannis Milis (AUEB) TBA |
| 12:40 - 13:20 | Iordanis Kerenidis (CNRS) Quantum vs. Classical One-way Communication Complexity |
| 13:20 - 14:00 | Aris Pagourtzis (NTUA) On the Complexity of Counting when Decision is Easy |
| 14:00 - 16:00 | Lunch break - Free time |
| 16:00 - 16:50 | Vangelis Paschos (Paris-Dauphine) Probabilistic Models for the Steiner Tree Problem |
| 16:50 - 17:30 | Nikolaos Laoutaris (Boston-UoA) Implications of Selfish Neighbor Selection in Overlay Networks |
| 17:30 - 17:50 | Coffee break |
| 17:50 - 18:30 | Evripidis Bampis (Evry) Multiobjective Optimization and Polynomial Time Approximation |
| 18:30 - 19:10 | Aristotelis Giannakos (Paris-Dauphine) On-line Models for Set-Covering: the Power of Greediness |