Skip list

Known as: Skiplist, Skiplists, Jump list 
In computer science, a skip list is a data structure that allows fast search within an ordered sequence of elements. Fast search is made possible by… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper, we introduce the Rotating skip list, the fastest concurrent skip list to date. Existing concurrent data structures… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
This paper presents a new non-blocking skip list algorithm. The algorithm alleviates contention by localizing synchronization at… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
2012
2012
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2011
2011
We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2008
2008
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 8
Is this relevant?
2008
2008
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
List-based implementations of sets are a fundamental building block of many concurrent algorithms. A skiplist based on the lock… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Lock-free shared data structures implement distributed objects without the use of mutual exclusion, thus providing robustness and… (More)
  • figure 1
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 8
  • figure 11
Is this relevant?