Skip trees, an alternative data structure to skip lists in a concurrent approach (Q4361577): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theory for random skip lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal pagination of B-trees with variable-length items / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-fly garbage collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A design of a parallel dictionary using skip lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining \(B\)-trees on an EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-the-fly optimization of data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The higher moments of the number of returns of a simple random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic binary search trees: A structure for concurrent rebalancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed avl trees, main-memory databases and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the correspondence between AVL trees and brother trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average search and update costs in skip lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on skip-lists / rank
 
Normal rank

Latest revision as of 19:40, 27 May 2024

scientific article; zbMATH DE number 1080090
Language Label Description Also known as
English
Skip trees, an alternative data structure to skip lists in a concurrent approach
scientific article; zbMATH DE number 1080090

    Statements

    Skip trees, an alternative data structure to skip lists in a concurrent approach (English)
    0 references
    0 references
    11 June 1998
    0 references
    0 references
    Skip trees
    0 references
    Skip lists
    0 references
    sequential update algorithms
    0 references
    B-trees
    0 references
    0 references