Optimal 2,3-Trees

DOI10.1137/0208004zbMath0416.68057OpenAlexW2108015606MaRDI QIDQ5895353

Raymond E. Miller, Arnold L. Rosenberg, Lawrence V. Snyder, Nicholas J. 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)

Related Items (4)

An elementary approach to some analytic asymptotics ⋮ Modeling B-tree insertion activity ⋮ Periodic oscillations of coefficients of power series that satisfy functional equations ⋮ Colored operads, series on colored operads, and combinatorial generating systems

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