Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A repertoire for add ...
Conference paper

A repertoire for additive functionals of uniformly distributed m-ary search trees

James Allen Fill, Nevin Kapur (1)
(1) Department of Computer Science
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Proceedings
DOI
10.46298/dmtcs.3370
License
https://about.hal.science/hal-authorisation-v1
Studies in Perfect Simulation and Combinatorial Probability
Indicators
563
Views
470
Downloads

A repertoire for additive functionals of uniformly distributed m-ary search trees

James Allen Fill, Nevin Kapur (1)
(1) Department of Computer Science
Abstract
Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on $m$-ary search trees on $n$ keys with toll sequence $(i) n^α$ with $α ≥ 0 (α =0$ and $α =1$ correspond roughly to the space requirement and total path length, respectively); $(ii) ln \binom{n} {m-1}$, which corresponds to the so-called shape functional; and $(iii) $$1$$_{n=m-1}$, which corresponds to the number of leaves.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]
  • leaves
  • space requirement
  • singularity analysis
  • shape functional
  • search trees
  • additive functionals
  • Hadamard products
  • limit laws
  • method of moments
Cited by

Source: OpenCitations

  • Cost functionals for large (uniform and simply generated) random trees

    Electronic Journal of Probability

    Authors : Jean-François Delmas ORCID, Jean-Stéphane Dhersin, Marion Sciauveau

    Journal reference : Volume 23, 2018, pp.

    DOI : 10.1214/18-ejp213
Preview
Loading PDF preview...