Three algorithms on Braun trees

DOI10.1017/S0956796897002876zbMath0942.68032OpenAlexW2095624220MaRDI QIDQ4234772

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)

Related Items (5)

Calculating datastructures ⋮ Efficiency of lambda-encodings in total type theory ⋮ On constructing 2-3 trees ⋮ An Overview of Edison ⋮ A Coq Library for Internal Verification of Running-Times

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