Results 11  20
of
290
Skip List Eiffel in Depth Exercise – Genericity
"... Skip lists [1] are a data structure for storing sorted items. They use multiple sorted linked lists with increasing sparsity, each of which contains a subset of the items to speed up locating certain position in the list. Figure 1. Sorted linked list and skip list As shown by the example in Figure 1 ..."
Abstract
 Add to MetaCart
Skip lists [1] are a data structure for storing sorted items. They use multiple sorted linked lists with increasing sparsity, each of which contains a subset of the items to speed up locating certain position in the list. Figure 1. Sorted linked list and skip list As shown by the example in Figure
Analysis of a new skip list variant
, 2006
"... For a skip list variant, introduced by Cho and Sahni, we analyse what is the analogue of horizontal plus vertical search cost in the original skip list model. While the average in Pugh’s original version behaves likeÉÐÓ�ÉÒ, withÉ�Õa parameter, it is here given byÉ ÐÓ�ÉÒ. ..."
Abstract
 Add to MetaCart
For a skip list variant, introduced by Cho and Sahni, we analyse what is the analogue of horizontal plus vertical search cost in the original skip list model. While the average in Pugh’s original version behaves likeÉÐÓ�ÉÒ, withÉ�Õa parameter, it is here given byÉ ÐÓ�ÉÒ.
A Provably Correct Scalable Concurrent Skip List
"... Abstract. We propose a new concurrent skip list algorithm distinguished by a combination of simplicity and scalability. The algorithm employs optimistic synchronization, searching without acquiring locks, followed by short lockbased validation before adding or removing nodes. It also logically remo ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Abstract. We propose a new concurrent skip list algorithm distinguished by a combination of simplicity and scalability. The algorithm employs optimistic synchronization, searching without acquiring locks, followed by short lockbased validation before adding or removing nodes. It also logically
Efficient Authenticated Dictionaries with Skip Lists and Commutative Hashing
 TECH. REP., JOHNS HOPKINS INFORMATION SECURITY INSTITUTE
, 2001
"... We present an efficient and practical technique for dynamically maintaining an authenticated dictionary. The main building blocks of our scheme are the skip list data structure and cryptographic associative hash functions. Applications of our work include certificate revocation in public key infrast ..."
Abstract

Cited by 36 (11 self)
 Add to MetaCart
We present an efficient and practical technique for dynamically maintaining an authenticated dictionary. The main building blocks of our scheme are the skip list data structure and cryptographic associative hash functions. Applications of our work include certificate revocation in public key
Dynamic Optimality for Skip Lists and BTrees
, 2008
"... 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 [35]. We prove that for a class of skip lists that satisfy a weak balancing property, the workingset bound is a lower bou ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
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 [35]. We prove that for a class of skip lists that satisfy a weak balancing property, the workingset bound is a lower
Skip List: Implementation, Optimization and Web Search
"... Even as computer processing speeds have become faster and the size of memory has also increased over the years, the need for elegant algorithms (programs that accomplish such tasks/operations as information retrieval, and manipulation as efficiently as possible) remain as important now as it did in ..."
Abstract
 Add to MetaCart
in the past. It is even more so as more complex problems come to the fore. Skip List is a probabilistic data structure with algorithms to efficiently accomplish such operations as search, insert and delete. In this paper, we present the results of implementing the Skip List data structure. The paper also
No Hot Spot NonBlocking Skip List
"... Abstract—This paper presents a new nonblocking skip list algorithm. The algorithm alleviates contention by localizing synchronization at the least contended part of the structure without altering consistency of the implemented abstraction. The key idea lies in decoupling a modification to the struc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—This paper presents a new nonblocking skip list algorithm. The algorithm alleviates contention by localizing synchronization at the least contended part of the structure without altering consistency of the implemented abstraction. The key idea lies in decoupling a modification
Skip Lists: A Randomized Dictionary
, 1999
"... Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a data structure such that the following three operations can be performed eciently: 1. Search(x): Given a real number x, nd the largest element of S[f1g that is less than or equal to x. (By introducing ..."
Abstract
 Add to MetaCart
Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a data structure such that the following three operations can be performed eciently: 1. Search(x): Given a real number x, nd the largest element of S[f1g that is less than or equal to x. (By introducing 1, this operation is always welldened.) 2. Insert(x): Given a real number x, insert it into the data structure. (Hence, we set S := S [ fxg.) 3. Delete(x): Given a real number x, delete it from the data structure. (Hence, we set S := S n fxg.) The standard data structure for this problem is a balanced binary search tree. It solves the dictionary prob
“Skip List Data Structures for Multidimensional Data ” page 1 of 39 Skip List Data Structures for Multidimensional Data
, 1994
"... This report presents four new data structures for multidimensional data. All of these data structures are based on the deterministic skip list. Explanations are provided for the 2d search skip list and three different versions of the kd skip list. These structures support fast insertion and deleti ..."
Abstract
 Add to MetaCart
This report presents four new data structures for multidimensional data. All of these data structures are based on the deterministic skip list. Explanations are provided for the 2d search skip list and three different versions of the kd skip list. These structures support fast insertion
Finger Search Trees, Skip Lists, Treaps
"... Finger searching is a good way to facilitate efficient search. A finger search beginning at a particular element of an array is done by an exponential search by inspecting the elements at a distance of 2 i1 from the finger. Alternative to finger search trees are treaps and skip lists. A treap satis ..."
Abstract
 Add to MetaCart
Finger searching is a good way to facilitate efficient search. A finger search beginning at a particular element of an array is done by an exponential search by inspecting the elements at a distance of 2 i1 from the finger. Alternative to finger search trees are treaps and skip lists. A treap
Results 11  20
of
290