Skip to Main content Skip to Navigation
Journal articles

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

Abstract : We adapt a novel idea of Cichon's related to Approximate Counting to the present instance of Digital Search Trees, by using m (instead of one) such trees. We investigate the level polynomials, which have as coefficients the expected numbers of data on a given level, and the insertion costs. The level polynomials can be precisely described, thanks to formulae from q-analysis. The asymptotics of expectation and variance of the insertion cost are fairly standard these days and done with Rice's method.
Document type :
Journal articles
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990489
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:39:22 PM
Last modification on : Thursday, September 7, 2017 - 1:03:36 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:15:02 PM

File

2000-6434-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990489, version 1

Collections

Citation

Helmut Prodinger. Digital search trees with m trees: Level polynomials and insertion costs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2011, Vol. 13 no. 3 (3), pp.1--7. ⟨hal-00990489⟩

Share

Metrics

Record views

81

Files downloads

661