Filters








213,005 Hits in 2.0 sec

Biased Skip Lists

Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
2005 Algorithmica  
We design a variation of skip lists that performs well for generally biased access sequences.  ...  Using skip list technology eliminates tree rotations.  ...  Biased Skip Lists A skip list [18] S is a dictionary data structure, storing an ordered set X, the items of which we number 1 through |X|.  ... 
doi:10.1007/s00453-004-1138-6 fatcat:dlpg24hye5cbhlkhxvb5zx44oq

Biased Skip Lists [chapter]

Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
2002 Lecture Notes in Computer Science  
We design a variation of skip lists that performs well for generally biased access sequences.  ...  Using skip list technology eliminates tree rotations.  ...  Biased Skip Lists A skip list [18] S is a dictionary data structure, storing an ordered set X, the items of which we number 1 through |X|.  ... 
doi:10.1007/3-540-36136-7_1 fatcat:uomitb252vbzznktj2rb44bdqu

Lock-free linked lists and skip lists

Mikhail Fomitchev, Eric Ruppert
2004 Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04  
We then give a lockfree implementation of a skip list dictionary data structure that uses the new linked list algorithms to implement individual levels.  ...  We present a new lock-free implementation of singly-linked lists.  ...  skip-list.  ... 
doi:10.1145/1011767.1011776 dblp:conf/podc/FomitchevR04 fatcat:n4t6ecl2cfhdzb4ad3bz7qorky

Authenticated Append-only Skip Lists [article]

Petros Maniatis, Mary Baker
2003 arXiv   pre-print
The resulting data structure, called an Authenticated Append-Only Skip List (AASL), allows its maintainers to produce one-way digests of the entire data sequence, which they can publish to others as a  ...  Design An Authenticated Append-only Skip List (AASL) is a data structure conceptually based on skip lists [7] .  ...  [3] retrofit skip lists for tamper-evidence. In that work, the authors propose an authenticated skip list that relies on commutative hashing. Anagnostopoulos et al.  ... 
arXiv:cs/0302010v1 fatcat:tov5fc23ezfipbingmglyyjltu

Tiara: A self-stabilizing deterministic skip list and skip graph

Thomas Clouser, Mikhail Nesterenko, Christian Scheideler
2012 Theoretical Computer Science  
It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.  ...  The skip graph can be viewed as a collection of skip-lists rooted in every node. Thus, unlike a skip list, the search in a skip graph has a downward phase only.  ...  It stabilizes a novel distributed skip list.  ... 
doi:10.1016/j.tcs.2011.12.079 fatcat:uqrhequ37vdbtjoiddzqcj7r5e

The Splay-List: A Distribution-Adaptive Concurrent Skip-List [article]

Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami
2020 arXiv   pre-print
At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements "move up," whereas rarely-accessed  ...  In this paper, we investigate distribution-adaptive concurrent data structures and propose a new design called the splay-list.  ...  The splay-list design builds on the classic skip-list by Pugh [21] .  ... 
arXiv:2008.01009v1 fatcat:mjv6mywvzvaqjelz2pw5zplc4a

The Splay-List: A Distribution-Adaptive Concurrent Skip-List

Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami, Hagit Attiya
2020 International Symposium on Distributed Computing  
At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements "move up," whereas rarely-accessed  ...  In this paper, we investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list.  ...  : A Distribution-Adaptive Concurrent Skip-List Preliminaries.  ... 
doi:10.4230/lipics.disc.2020.3 dblp:conf/wdag/AksenovADM20 fatcat:kieemrlobrf4jijzqs4rgc2zum

The path length of random skip lists

Peter Kirschenhofer, Helmut Prodinger
1994 Acta Informatica  
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 .  ...  The number of linked lists which an element belongs to is constant as long as the element exists in the skip list.  ... 
doi:10.1007/bf01178735 fatcat:ql2aee52j5eyxgvlo5ch4ng3z4

Analysis of a new skip list variant

Guy Louchard, Helmut Prodinger
2006 Discrete Mathematics & Theoretical Computer Science  
International audience 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.  ...  This substitution is common in the analysis of skip-list structures (Euler transform).  ...  Introduction Skip lists were introduced by Pugh (10) and analysed in (7; 4; 9) and also some other papers.  ... 
doi:10.46298/dmtcs.3476 fatcat:6hidssiyjrhsjktcpy7ykmayni

Authenticated Relational Tables and Authenticated Skip Lists [chapter]

Giuseppe Di Battista, Bernardo Palazzi
2007 Lecture Notes in Computer Science  
Fig. 1 . 1 Skip List Fig. 2 . 2 A value searching in a Skip List: search for element 9 in the skip list ofFigure 1.  ...  In randomized skip lists, the expected number of plateau elements between two tower elements is one. The skip list of Fig. 1 has 7 elements (including sentinels).  ... 
doi:10.1007/978-3-540-73538-0_3 fatcat:iewx4zip6zdu7ac3jjzi5ey4sm

Tiara: A Self-stabilizing Deterministic Skip List [chapter]

Thomas Clouser, Mikhail Nesterenko, Christian Scheideler
2008 Lecture Notes in Computer Science  
It is based on a novel sparse 0-1 skip list. We rigorously prove the algorithm correct in the shared register model. We then describe its extension to a ring and incorporation of crash tolerance.  ...  It stabilizes a novel 0-1 distributed skip list.  ...  That is, Tiara reconstructs the connectivity of the base sorted list on the basis of skip list links.  ... 
doi:10.1007/978-3-540-89335-6_12 fatcat:u6yhzu7g3jfjpk6z43i2inojjm

No Hot Spot Non-blocking Skip List

Tyler Crain, Vincent Gramoli, Michel Raynal
2013 2013 IEEE 33rd International Conference on Distributed Computing Systems  
This paper presents a new non-blocking skip list algorithm.  ...  On SPECjbb as well as on micro-benchmarks, we compared the performance of our new non-blocking skip list against the performance of the JDK non-blocking skip list.  ...  THE NON-BLOCKING SKIP LIST In this section, we present our CF non-blocking skip list.  ... 
doi:10.1109/icdcs.2013.42 dblp:conf/icdcs/CrainGR13 fatcat:xca2ml7cinegxe7ku6tqnaouge

QUISIS: A Query Index Method Using Interval Skip List
QUISIS: Interval Skip List를 활용한 질의 색인 기법

Jun-Ki Min
2008 The KIPS Transactions PartD  
In this paper, we propose an efficient query index scheme, called QUISIS, using a modified Interval Skip Lists to accelerate search time.  ...  제안된 질의 색인 구조는 Interval Skip List를 기반으로 하고 있다.  ...  따라서 우선 Interval Skip List에 대하여 설명한다.3.1 Interval Skip ListInterval Skip List [20] 는 각 노드가 하나 이상의 앞방향 포인터(forward pointer)를 가지고 있다는 점을 제외하고는 연결 리스트와 유사하다.  ... 
doi:10.3745/kipstd.2008.15-d.3.297 fatcat:5dusnapb75bf7l27lnlcbv5khy

Skip trees, an alternative data structure to skip lists in a concurrent approach

Xavier Messeguer
1997 RAIRO - Theoretical Informatics and Applications  
SKIP LISTS Skip lists are randomized data structures introduced by W. Pugh in 1990 [22] .  ...  Mapping between Skip trees and Skip lists We define the mapping between Skip trees and Skip lists, and we prove that it is one-to-one function and that local rules of Skip lists commute with local rule  ... 
doi:10.1051/ita/1997310302511 fatcat:usuut6uzm5frlkfkfmgansl4uu

A New Timestamping Scheme Based on Skip Lists [chapter]

Kaouthar Blibech, Alban Gabillon
2006 Lecture Notes in Computer Science  
In this paper, we first define a new timestamping scheme which is based on skip lists [11] . Then, we show that our scheme offers nice properties and optimal performances.  ...  Our scheme uses one append-only perfect skip list per round. Elements of the skip lists are the timestamping requests. Each new request is appended to the skip list.  ...  -The TSA appends h to the skip list.  ... 
doi:10.1007/11751595_43 fatcat:2tosgufluzekhhrdlgftcayjyi
« Previous Showing results 1 — 15 out of 213,005 results