Randomized splay trees: Theoretical and experimental results. (Q1603506): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Splaying a search tree in preorder takes linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Explanation of Splaying / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential access in splay trees takes linear time / rank
 
Normal rank

Revision as of 11:48, 4 June 2024

scientific article
Language Label Description Also known as
English
Randomized splay trees: Theoretical and experimental results.
scientific article

    Statements

    Randomized splay trees: Theoretical and experimental results. (English)
    0 references
    0 references
    0 references
    14 July 2002
    0 references
    Data structures
    0 references
    Randomized algorithms
    0 references
    Splay trees
    0 references

    Identifiers