![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Adriano Di Pasquale 3 Adriano Di Pasquale, Enrico Nardelli : A Very Efficient Order Preserving Scalable Distributed Data Structure. DEXA 2001 : 186-199 2 Adriano Di Pasquale, Enrico Nardelli : ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs. SOFSEM 2001 : 211-222 1 Adriano Di Pasquale, Enrico Nardelli : Distributed Searching of k -Dimensional Data with Almost Constant Costs. ADBIS-DASFAA 2000 : 239-250 ![]() DiSC'02 © 2003 Association for Computing Machinery |