Sciweavers

21 search results - page 1 / 5
» Balanced Search Trees Made Simple
Sort
View
WADS
1993
Springer
136views Algorithms» more  WADS 1993»
14 years 2 months ago
Balanced Search Trees Made Simple
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...
Arne Andersson
ACMSE
2007
ACM
14 years 2 months ago
Exploring the duality between skip lists and binary search trees
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...
Brian C. Dean, Zachary H. Jones
AINA
2009
IEEE
14 years 5 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...
MST
2006
136views more  MST 2006»
13 years 10 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
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...
David R. Karger, Matthias Ruhl