Skip lift: a probabilistic alternative to red-black trees (Q450539): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.12.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180616177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased skip lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal finger search trees in the pointer machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two New Kinds of Biased Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A balanced search tree O(1) worst-case update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating a balanced search tree in 0(1) rotations / rank
 
Normal rank

Latest revision as of 17:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Skip lift: a probabilistic alternative to red-black trees
scientific article

    Statements

    Skip lift: a probabilistic alternative to red-black trees (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    0 references
    data structure
    0 references
    dictionary
    0 references
    skip list
    0 references
    finger search
    0 references
    0 references