Three algorithms on Braun trees

DOI10.1017/S0956796897002876MaRDI QIDQ4234772zbMATH OpenOpenAlexFDO

Authors Chris Okasaki

Publication date 16 March 1999

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

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

zbMATH Keywords

Braun trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 512955
• FUNCTIONAL PEARL On building trees with minimum height
• Balancing binary trees by internal path reduction

Cited in

(6)

• A Coq library for internal verification of running-times
• scientific article; zbMATH DE number 512955 (Why is no real title available?)
• On constructing 2-3 trees
• An overview of Edison
• Efficiency of lambda-encodings in total type theory
• Calculating datastructures

This page was built for publication: Three algorithms on Braun trees

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