21 search results - page 1 / 5 » Balanced Search Trees Made Simple |
WADS
1993
Springer
13 years 8 months ago
1993
Springer
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...
ICSOFT
2007
13 years 6 months ago
2007
ACMSE
2007
ACM
13 years 8 months ago
2007
ACM
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
AINA
2009
IEEE
13 years 11 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
MST
2006
13 years 4 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...