Optimal 2,3-Trees

DOI10.1137/0208004MaRDI QIDQ5895353zbMATH OpenOpenAlexFDO

Authors Raymond E. Miller, Arnold L. Rosenberg, Lawrence V. Snyder, Nicholas Pippenger

Publication date 1979

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0208004

zbMATH Keywords

enumerationB-treesnode-visit cost2,3-trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited in

(5)

• Colored operads, series on colored operads, and combinatorial generating systems
• Modeling B-tree insertion activity
• An elementary approach to some analytic asymptotics
• Periodic oscillations of coefficients of power series that satisfy functional equations
• Succinct encodings of binary trees with application to AVL trees

This page was built for publication: Optimal 2,3-Trees

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