Results 1  10
of
47,825
Skip Lists: A Probabilistic Alternative to Balanced Trees
, 1990
"... Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees. ..."
Abstract

Cited by 412 (1 self)
 Add to MetaCart
Skip lists are data structures thla t use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
A skip list cookbook
, 1990
"... Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space. The original paper ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space. The original paper
Biased Skip Lists
 ALGORITHMICA
, 2004
"... We design a variation of skip lists that performs well for generally biased access sequences. Given n items
..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
We design a variation of skip lists that performs well for generally biased access sequences. Given n items
The path length of random skip lists
 ACTA INFORMATICA
, 1994
"... The skip list is a recently introduced data structure that may be seen as an alternative to (digital) tries. In the present paper we analyze the path length of random skip lists asymptotically, i.e. we study the cumulated successful search costs. In particular we derive a precise asymptotic result ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
The skip list is a recently introduced data structure that may be seen as an alternative to (digital) tries. In the present paper we analyze the path length of random skip lists asymptotically, i.e. we study the cumulated successful search costs. In particular we derive a precise asymptotic
On the Cost of Persistence and Authentication in Skip Lists
"... 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 that allow us to study the performance overhead of authentication and persistence. We explore various design decisions ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
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 that allow us to study the performance overhead of authentication and persistence. We explore various design
Parallel Update And Search In Skip Lists
"... We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are simple and easy to explain and implement. All of them are iterative. They can be ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are simple and easy to explain and implement. All of them are iterative. They can
Authenticated Appendonly Skip Lists
 Acta Mathematica
, 2003
"... In this work we describe, design and analyze the security of a tamperevident, appendonly data structure for maintaining secure data sequences in a loosely coupled distributed system where individual system components may be mutually distrustful. The resulting data structure, called an Authenticate ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
an Authenticated AppendOnly Skip List (AASL), allows its maintainers to produce oneway digests of the entire data sequence, which they can publish to others as a commitment on the contents and order of the sequence. The maintainer can produce eciently succinct proofs that authenticate a particular datum in a
Authenticated Appendonly Skip Lists
 Acta Mathematica
, 2003
"... In this work we describe, design and analyze the security of a tamperevident, appendonly data structure for maintaining secure data sequences in a loosely coupled distributed system where individual system components may be mutually distrustful. The resulting data structure, called an Authenticate ..."
Abstract
 Add to MetaCart
an Authenticated AppendOnly Skip List (AASL), allows its maintainers to produce oneway digests of the entire data sequence, which they can publish to others as a commitment on the contents and order of the sequence. The maintainer can produce e#ciently succinct proofs that authenticate a particular datum in a
Implementation of an Authenticated Dictionary with Skip Lists and Commutative Hashing
 DARPA INFORMATION SURVIVABILITY CONFERENCE AND EXPOSITION
, 2001
"... We present the software architecture and implementation of an efficient data structure for dynamically maintaining an authenticated dictionary. The building blocks of the data structure are skip lists and oneway commutative hash functions. We also present the results of a preliminary experiment on ..."
Abstract

Cited by 91 (27 self)
 Add to MetaCart
We present the software architecture and implementation of an efficient data structure for dynamically maintaining an authenticated dictionary. The building blocks of the data structure are skip lists and oneway commutative hash functions. We also present the results of a preliminary experiment
Optimal And Nearly Optimal Static Weighted Skip Lists
"... . We consider the problem of building a static (i.e. no updates are performed) skip list of n elements, given these n elements and the corresponding access probabilities or weights. We develop a dynamic programming algorithm that builds an optimal skip list in the sense that the average access cost ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. We consider the problem of building a static (i.e. no updates are performed) skip list of n elements, given these n elements and the corresponding access probabilities or weights. We develop a dynamic programming algorithm that builds an optimal skip list in the sense that the average access cost
Results 1  10
of
47,825