Digital search trees with m trees: Level polynomials and insertion costs

Helmut Prodinger. Digital search trees with m trees: Level polynomials and insertion costs. Discrete Mathematics & Theoretical Computer Science, 13(3):1-8, 2011. [doi]

Authors

Helmut Prodinger

This author has not been identified. Look up 'Helmut Prodinger' in Google