Logic List Mailing Archive
1st Athens Colloquium on Algorithms and Complexity, Athens (Greece), Aug 2006
CALL FOR PARTICIPATION
1st Athens Colloquium on Algorithms and Complexity
ACAC 2006
22-23 August, 2006
Athens, Greece
http://www.corelab.ece.ntua.gr/acac06
Scope: ACAC is a biannual meeting aiming to bring together researchers
working in all areas of the theory of algorithms and computational
complexity. It is expected to serve as a lively forum for presenting
research results that are in a preliminary stage or have been recently
presented in some major conference. For this first meeting there will be
no regular submissions. Invited contributions may appear, fully or
partially, in informal proceedings distributed at the workshop. The
language of the workshop is English.
Venue: National Technical University of Athens, Greece, Zografou Campus,
Multimedia Room. For directions on how to reach the campus see
http://www.ntua.gr/en_ntua/campus.htm.
Registration: There will be no registration fees. However, participants
should register for administrative purposes no later than August 16.
Organizing Committee: Elias Koutsoupias, Ioannis Milis, Aris Pagourtzis,
Stathis Zachos (chair), Vassilis Zissimopoulos.
Contact: for registration and further details please contact Aris
Pagourtzis (pagour AT cs DOT ntua DOT gr).
Acknowledgement: The colloquium is supported by the General Secretariat of
Research and Technology of Greece through PENED 2003 programme, contract
nr. 03ED285, co-funded by the European Social Fund (75%) and national
resources (25%).
Preliminary Program
================================================================
TUESDAY, AUGUST 22, 2006
09:30 - 10:00 Registration - Reception
10:00 - 10:10 Welcome and Opening Remarks
10:10 - 11:00 Hierarchies of Complexity Classes
- Stathis Zachos, NTUA - CUNY
11:00 - 11:40 On the Fourier Spectrum of Symmetric Boolean
Functions (with applications to learning
symmetric juntas)
- Vangelis Markakis, Toronto
11:40 - 12:00 Coffee break
12:00 - 12:40 On the Relation between Vehicle Scheduling and
Path Coloring
- Michael Lampis, NTUA
12:40 - 13:20 Mobile Agent Rendezvous in Graphs
- Euripides Markou, UoA
13:20 - 14:00 Fast Leader-Election Protocols with Bounded
Cheaters' Edge
- Spyridon Antonakopoulos, Columbia
14:00 - 16:00 Lunch break - Free time
16:00 - 16:50 Applications of Random Matrices to Spectral
Computations and Machine Learning
- Dimitris Achlioptas, UC Santa Cruz
16:50 - 17:30 Optimization Problems in Multifiber
Optical Networks
- Katerina Potika, NTUA
17:30 - 17:50 Coffe break
17:50 - 18:30 Norm, Point, and Distance Estimation Over
Multiple Signals Using Max-Stable Distributions
- George Kollios, Boston
18:30 - 19:10 On the Complexity of Polynomial Real Solving
- Elias Tsigaridas, UoA
19:10 - 20:00 On Mechanisms for Scheduling on Unrelated Machines
- Elias Koutsoupias, UoA
20:30 - Conference dinner
WEDNESDAY, AUGUST 23, 2006
10:10 - 11:00 Dynamic Graph Problems and Algorithms
- Vassilis Zissimopoulos, UoA
11:00 - 11:40 TBA
- Constantinos Daskalakis, UC Berkeley
11:40 - 12:00 Coffee break
12:00 - 12:40 TBA
- Ioannis Milis, AUEB
12:40 - 13:20 Quantum vs. Classical One-way Communication
Complexity
- Iordanis Kerenidis, CNRS
13:20 - 14:00 On the Complexity of Counting when
Decision is Easy
- Aris Pagourtzis, NTUA
14:00 - 16:00 Lunch break - Free time
16:00 - 16:50 TBA
- Vangelis Paschos, Paris-Dauphine
16:50 - 17:30 Implications of Selfish Neighbor Selection in
Overlay Networks
- Nikolaos Laoutaris, Boston - UoA
17:30 - 17:50 Coffe break
17:50 - 18:30 Multiobjective Optimization and Polynomial Time
Approximation
- Evripidis Bampis, Evry
18:30 - 19:10 TBA
- Aristotelis Giannakos, Paris-Dauphine
================================================================