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

zbMATH Open1283.68144MaRDI QIDQ5403000FDOQ5403000

Helmut Prodinger

Publication date: 25 March 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2000/0.html

Recommendations

• scientific article; zbMATH DE number 849078
• The variance of the profile in digital search trees
• scientific article; zbMATH DE number 2013191
• The \(m\)-version of binary search trees: an average case analysis
• Digital Search Trees Again Revisited: The Internal Path Length Perspective

zbMATH Keywords

Rice's methodcancellationsdigital search tree\(q\)-analysislevel polynomial

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Trees (05C05) Data structures (68P05) Searching and sorting (68P10)

Cited In (2)

• Title not available (Why is that?)
• Application of basic hypergeometric series.

This page was built for publication: Digital search trees with \(m\) trees: level polynomials and insertion costs

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