ADS 2003 Algorithms and Data Structures June 2227, 2003 

Sunday, June 22  
18:0021:00  Reception 
Monday, June 23 

08:3009:30  Breakfast 
09:5010:00  Welcome address 
10:0010:45 
Frank Schulz (University of Konstanz) "Using multilevel graphs for fast singlepair shortestpath computation" 
10:4511:15  Coffee break 
11:1512:00  Roberto Grossi (Universita' di Pisa) "Efficient implicit data structures for the dictionary problem" 
12:0014:30  Lunch 
14:3015:15  John Iacono (Polytechnic University) "Inputsensitive data structures" 
15:1516:00  Stefan Langerman (Universite Libre de Bruxelles) "Inputsensitive data structures" (cont'd) 
16:0016:30  Coffee break 
16:3019:30  Time for meetings and discussions 
19:30  Dinner (Altopalato) 
Tuesday, June 24 

08:3009:30  Breakfast 
10:0010:45  Amos Fiat (Tel Aviv University) "Some issues regarding peer to peer networks" 
10:4511:15  Coffee break 
11:1512:00  Andrew Goldberg (Microsoft Research) "Competitive auctions" 
12:0014:30  Lunch 
14:3015:15  Valerie King (University of Victoria) "Complexity of reconstructing phylogenetic trees" 
15:1516:00  Giancarlo Mauri (Università di Milano  Bicocca) "Pattern discovery in nucleotide sequences: methods and data structures" 
16:0016:30  Coffee break 
16:3017:30  Problems session 
17:3019:30  Time for meetings and discussions 
19:30  Dinner 
Wednesday, June 25  
08:3009:30  Breakfast 
10:0010:45  Giuseppe F. Italiano (Universita' di Roma "Tor Vergata) "A new approach to dynamic all pairs shortest paths" 
10:4511:15  Coffee break 
11:1512:00  Camil Demetrescu (Universita' di Roma "La Sapienza") "An experimental analysis of dynamic all pairs shortest paths algorithms" 
12:0014:30  Lunch 
14:30  Excursion to Ravenna 
Thursday, June 26  
08:3009:30  Breakfast 
10:0010:45  Gerth S. Brodal (University of Aarhus) "Cache oblivious sorting" 
11:1512:00  Lars Arge (Duke University) "Cacheoblivious orthogonal range searching" 
12:0014:30  Lunch 
14:3015:15  Haim Kaplan (Tel Aviv University) "Inverse range searching with priorities" 
15:1515:45  Coffee break 
15:4516:30  Marco Pellegrini (IIT  CNR) "Internet packet filtering on any number of attributes via multidimensional point stabbing" 
16:3016:35  Adjourn 
19:30  Dinner 
Arrival:  Sunday June 22 2003 

Meeting:  Monday June 23 (morning) to Thursday June 27 (afternoon) 
Departure:  Friday June 27, 2003 
Bertinoro itself is picturesque, with many narrow streets and walkways winding around the central peak. The meeting will be held in a redoubtable exEpiscopal fortress that has been converted by the University of Bologna into a modern conference center with computing facilities and Internet access. From the fortress you can enjoy a beautiful the vista that stretches from the Tuscan Apennines to the Adriatic coast.
Directions are available here.
Accomodation costs are 105 EUR (single) or 95 EUR (sharing a double) per day, including breakfast, meals, and coffee breaks. The cost for accompanying persons is 52 EUR (single) or 43 EUR (sharing a double) per day, including breakfast and lunches.
Ph.D. students interested in attending the meeting can contact Camil Demetrescu or Giuseppe F. Italiano.
Scientific Organizing Committee  Camil Demetrescu University of Rome "La Sapienza"  

Giuseppe F. Italiano, University of Rome "Tor Vergata"  
Local Organization  
Andrea Bandini, Elena Della Godenza, Centro Congressi di Bertinoro  
Sponsored by  BICI Bertinoro International Center for Informatics 
Cacheoblivious orthogonal range searching. 
Cacheoblivious sorting. 
An experimental analysis of dynamic all pairs shortest paths algorithms. 
Some issues regarding peer to peer networks. 
Competitive auctions. (Joint work with Amos Fiat, Jason Hartline, Anna Karlin, Andrew Wright) 
Efficient implicit data structures for the dictionary problem. (The results presented here are based on joint papers with Gianni Franceschini and on a paper with Gianni Franceschini, Ian Munro and Linda Pagli) 
Inputsensitive data structures. (Joint work with Erik Demaine) 
Inverse range searching with priorities. (Joint work with Eyal Molad and Robert E. Tarjan) 
Complexity of Reconstructing Phylogenetic Trees. 
A new approach to dynamic all pairs shortest paths. 
Pattern discovery in nucleotide sequences: methods and data structures.

Internet packet filtering on any number of attributes via multidimensional
point stabbing. Here we show that the same asymptotic complexity bound holds for any fixed number d of attributes. Moreover the data structure is dynamic and has low preprocessing time. As a corollary of the techniques used, we also show that, under the same general assumptions, orthogonal range counting queries over a set of n points with bounded integer coordinates can be answered in time O(1) in any fixed dimension d using storage O(n^{1+epsilon}). 
Using multilevel graphs for fast singlepair shortestpath computation. 