Linear-time construction of treaps and Cartesian trees (Q1339378): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4230325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Dynamic Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Divide-and-Conquer Maximin Recurrence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864244 / rank
 
Normal rank

Latest revision as of 09:45, 23 May 2024

scientific article
Language Label Description Also known as
English
Linear-time construction of treaps and Cartesian trees
scientific article

    Statements

    Linear-time construction of treaps and Cartesian trees (English)
    0 references
    0 references
    1 December 1994
    0 references
    heap-ordered deque
    0 references
    search tree
    0 references
    treap
    0 references
    Cartesian tree
    0 references

    Identifiers