On constructing 2-3 trees

DOI10.1017/S0956796818000187MaRDI QIDQ4625161zbMATH OpenOpenAlexFDO

Authors Ralf Hinze

Publication date 20 February 2019

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796818000187

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Publication:5750392
• Almost optimal dynamic 2-3 trees
• scientific article; zbMATH DE number 3845066
• scientific article; zbMATH DE number 3856447
• Algorithms and Computation

Cites work

• Finger trees: a simple general-purpose data structure
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Manufacturing datatypes
• Programming with Equations
• Purely Functional 1-2 Brother Trees
• Purely Functional Data Structures
• Three algorithms on Braun trees

Cited in

(6)

• A few logs suffice to build (almost) all trees. II
• Trees with 2-reinforcement number three
• CONSTRUCTING RED-BLACK TREE SHAPES
• Three tree-paths
• scientific article; zbMATH DE number 4185014 (Why is no real title available?)
• Construction of the developing connecting tree

This page was built for publication: On constructing 2-3 trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625161)