Purely Functional 1-2 Brother Trees
From MaRDI portal
Publication:3648351
DOI10.1017/S0956796809007333zbMath1191.68162WikidataQ124791710 ScholiaQ124791710MaRDI QIDQ3648351
Publication date: 25 November 2009
Published in: Journal of Functional Programming (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Functional programming and lambda calculus (68N18)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Balanced trees with removals: An exercise in rewriting and proof
- On the correspondence between AVL trees and brother trees
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Red-black trees with types
- Finger trees: a simple general-purpose data structure
- Purely Functional Data Structures
- Red-black trees in a functional setting
This page was built for publication: Purely Functional 1-2 Brother Trees