Digital search trees with m trees: Level polynomials and insertion costs
2011 ◽
Vol Vol. 13 no. 3
(Analysis of Algorithms)
◽
Keyword(s):
Analysis of Algorithms International audience 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.
2007 ◽
Vol DMTCS Proceedings vol. AH,...
(Proceedings)
◽
2010 ◽
Vol Vol. 12 no. 2
◽
2008 ◽
Vol DMTCS Proceedings vol. AI,...
(Proceedings)
◽
Keyword(s):
2010 ◽
Vol DMTCS Proceedings vol. AM,...
(Proceedings)
◽
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AD,...
(Proceedings)
◽
Keyword(s):
2011 ◽
Vol 43
(01)
◽
pp. 151-177
◽
Keyword(s):
1994 ◽
Vol 23
(3)
◽
pp. 598-616
◽