Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

SOFSEM
2001
Springer

favoriteEmaildiscussreport

108views Theoretical Computer Science» more SOFSEM 2001»

ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs

14 years 3 months ago

ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs

Download www.mat.uniroma2.it

Adriano Di Pasquale, Enrico Nardelli

Real-time Traffic

SOFSEM 2001 | Theoretical Computer Science |

claim paper

Related Content

» Distributed Searching of kDimensional Data with Almost Constant Costs

» Scalable Distributed Data Structures A Survey

» Scalability versus semantics of concurrent FIFO queues

» Simple Efficient LoadBalancing Algorithms for PeertoPeer Systems

» Incremental query evaluation for support vector machines

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	SOFSEM
Authors	Adriano Di Pasquale, Enrico Nardelli

Comments (0)