| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Adriano Di Pasquale Vittorio Bilò , Adriano Di Pasquale, Fabio Fioravanti , Michele Flammini , Luca Forlizzi , Francesco Lo Presti , Giovanna Melideo , Enrico Nardelli , Alfredo Navarra , Guido Proietti : Quality of Service in Wireless Networks. IPDPS 2003 : 224 Adriano Di Pasquale, Luca Forlizzi , Christian S. Jensen , Yannis Manolopoulos , Enrico Nardelli , Dieter Pfoser , Guido Proietti , Simonas Saltenis , Yannis Theodoridis , Theodoros Tzouramanis , Michael Vassilakopoulos : Access Methods and Query Processing Techniques. Spatio-Temporal Databases: The CHOROCHRONOS Approach 2003 : 203-261 Adriano Di Pasquale, Michele Flammini , Enrico Nardelli : Allocation Problems in Scalable Distributed Data Structures. WDAS 2002 : 133-142 Adriano Di Pasquale, Enrico Nardelli , Guido Proietti : An Improved Upper Bound for Scalable Distributed Search Trees. WDAS 2002 : 15-28 Adriano Di Pasquale, Fabrizio Luccio , Enrico Nardelli : Distributed Data & Structures 3, Records of the 3rd International Meeting (WDAS 2000), L'Aquilia, Italy, 23 June 2000, in conjunction with SIROCCO 2000 Carleton Scientific 2001 Adriano Di Pasquale, Enrico Nardelli : A Very Efficient Order Preserving Scalable Distributed Data Structure. DEXA 2001 : 186-199 Adriano Di Pasquale, Enrico Nardelli : ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs. SOFSEM 2001 : 211-222 Adriano Di Pasquale, Enrico Nardelli : Distributed Searching of k -Dimensional Data with Almost Constant Costs. ADBIS-DASFAA 2000 : 239-250 Adriano Di Pasquale, Enrico Nardelli : An Amoritized Lower Bound for Distributed Searching of k-dimensional Data. WDAS 2000 : 71-85 Adriano Di Pasquale, Fabrizio Luccio , Enrico Nardelli : Introduction: Distributed Data & Structures 3. WDAS 2000 Adriano Di Pasquale, Enrico Nardelli : Scalable Distributed Data Structures: A Survey. WDAS 2000 : 87-111 Adriano Di Pasquale, Enrico Nardelli : Fully Dynamic Balanced and Distributed Search Trees with Logarithmic Costs. WDAS 1999 : 73-90 1 [ 12 ] 2 [ 12 ] 3 [ 10 ] [ 12 ] 4 [ 11 ] [ 12 ] 5 [ 11 ] 6 [ 3 ] [ 8 ] 7 [ 11 ] 8 [ 12 ] 9 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] 10 [ 12 ] 11 [ 11 ] 12 [ 12 ] 13 [ 9 ] [ 11 ] [ 12 ] 14 [ 11 ] 15 [ 11 ] 16 [ 11 ] 17 [ 11 ]  ©2004 Association for Computing Machinery |
