9 search results - page 1 / 2 » Skip Lists: A Probabilistic Alternative to Balanced Trees |
WADS
1989
Springer
13 years 8 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
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...
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...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...