ALGORITHMICA
2005
13 years 11 months ago
2005
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
SODA
2008
ACM
14 years 26 days 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 [...
WADS
1989
Springer
14 years 3 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...
WEA
2007
Springer
14 years 5 months ago
2007
Springer
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures...