Purely Functional 1-2 Brother Trees (Q3648351): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124791710, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Red-black trees with types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finger trees: a simple general-purpose data structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Purely Functional Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced trees with removals: An exercise in rewriting and proof / 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: Red-black trees in a functional setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank

Latest revision as of 05:58, 2 July 2024

scientific article
Language Label Description Also known as
English
Purely Functional 1-2 Brother Trees
scientific article

    Statements