The ALCOM-FT project is a joint effort between ten of the leading groups in algorithms research in Europe. The aim of the project is to discover new algorithmic concepts, identify key algorithmic problems in important applications, and contribute to the accelerated transfer of advanced algorithmic techniques into commercial systems.
The first annual ALCOM-FT review meeting and workshop will be held in Rome on September 13-15, 2001.
The Meeting is located in the Cloister Hall of the School of Engineering of the University of Rome "La Sapienza":
Università di Roma "La Sapienza" (University of Rome "La Sapienza")
Facoltà di Ingegneria (School of Engineering)
Aula del Chiostro (Cloister Hall)
Via Eudossiana 18
00184 Roma, Italia
Via Eudossiana is a couple of streets north of the Colosseum.
The hotels for the participants are:
00185 Roma (RM) - 8, v. Principe Amedeo
tel.: 06 4814741
fax: 06 4882247
00184 Roma (RM) - 16, v. D'Azeglio
phone: +3906 4881061
fax: +3906 4882057
00184 Roma (RM) - 13, v. Nazionale
phone: +3906 486837
fax: +3906 4880014
|"Leonardo da Vinci" intercontinental airport, located in Fiumicino, is Europe's fourth largest in terms of number of passengers and provides travellers with the most modern services and facilities. The centre of Roma can be easily reached from the airport by bus, train or taxi.|
Trains from the airport
Leonardo da Vinci - Roma Termini (Central) Railway Station
|Train type: Leonardo Express|
about 32 minutes.
Non stop trains leave the airport every 30 minutes from 6.37 a.m. to 11.37 p.m.
|Ticket cost: Itl 17,000 / Euro 8.78|
da Vinci - Roma Tiburtina Railway Station
|Train type: FM1|
about 1 hour.
cost: Itl 9,000 / Euro 4.65
|Notice: train tickets must be purchased in advance and cancelled at the yellow machines on the train platform before getting on the train.|
Taxis and limousines
|Available at the International Arrivals area.|
|Approximate price: Itl 75,000 / Euro 38.74.|
Rome is at the heart of the Italian railway network. Excellent Intercity service from Termini Railway Station links Rome to every major city in Europe. See the site of Italian Railways for timetable queries and further details.
Italy has 6,400 km of modern motorways, which reach all regions of the country. Rome can easily be reached by car from the "Autostrada del Sole - A1", the longest Italian motorway running along the peninsula from north to south.
|Thursday, September 13, 2001:|
|9.00-9.30||Project officer and reviewers meet in private|
|9.30-9.45||Introduction (Erik Meineche Schmidt)|
|9.45-10.45||Work Package 4 (Mike Paterson) (*)|
|11.00-12.00||Work Package 2 (Christos Kaklamanis) (*)|
|12.00-12.45||Work Package 3 (Han Hoogevelt) (*)|
|14.00-15.00||Work Package 1 (Jose Balzasar) (*)|
|15.00-16.00||Work Package 5 (Kurt Mehlhorn) (*)|
|16.15-17.00||Project officer and reviewers meet in private|
(*) Each workpackage leader is requested to leave 15 minutes for discussion after their presentation.
|Friday, September 14, 2001|
|9.00-9.30||Peter Sanders: "Scheduling Parallel Disks"|
|9.30-10.00||Sotiris Nikoletseas: "An Efficient Communication Strategy for Ad-Hoc Mobile Networks"|
|10.00-10.30||Olaf Bonorden: "Implementation of Process Migration for a BSP Platform"|
|11.00-11.30||Rasmus Pagh: "Simple Hash Algorithms"|
|11.30-12.00||Luca Becchetti: "Non-Clairvoyant Scheduling on single and parallel machines"|
|12.00-12.30||Philippe Robert: "Congestion avoidance in communication networks: algorithms and stochastic models"|
|14.00-14.30||Jan van Leeuwen/Han Hoogevelt: TBA|
|14.30-15.00||Josep Diaz: "H-coloring"|
|15.00-15.30||Tom Friedetzky: "The Natural Work-Stealing Algorithm is Stable"|
|16.00-16.30||Matthias Elf: "Minimizing Breaks by Maximizing Cuts"|
|16.30-17.00||Juha Karkainen: "Better Filtering with Gapped Q-Grams"|
|17.00-17.30||Paul Spirakis: "The price of Selfish Routing"|
|Saturday, September 15, 2001|
|9.00-9.30||Paul Goldberg: "Estimating a Boolean Perceptron from its Average Satisfying Assignment: A Bound on the Precision Required"|
|9.30-10.00||Torsten Fahle: "Modelling and Solving Complex Nurse Rostering Problems"|
|10.00-10.30||Camil Demetrescu: "Fully Dynamic All-pairs Shortest Paths with Real Edge Weights"|
|11.00-11.30||Berthold Vocking: "Almost Optimal Permutation Routing on Hypercubes"|
|11.30-12.00||Gerth Brodal: "Cache Oblivious Search Trees via Binary Trees of Small Height"|
|12.00-12.30||Andrea Vitaletti: "Packing Power, Arranging Codes: Downlink Scheduling for Multirate Wireless Networks"|
On September 10-12, 2001, Rome will host the School on Algorithm Engineering, sponsored by ALCOM-FT and co-organized by Giuseppe F. Italiano (University of Rome "Tor Vergata") and by Giovanni Rinaldi (IASI-CNR).
Please stay tuned as more information on the meeting will be available soon. You can send me email in case you have any questions.
|Maintained by Camil Demetrescu - Last updated: September 7, 2001|
|Go to main page|