Distribution of inter-node distances in digital trees

zbMATH Open1104.68027MaRDI QIDQ5485347FDOQ5485347

Authors: Rafik Aguech, Nabil Lasmar, Hosam M. Mahmoud 

Publication date: 29 August 2006

Recommendations

• Distances in random digital search trees
• Limit distribution of distances in biased random tries
• scientific article; zbMATH DE number 849078
• The variance of the profile in digital search trees
• Imbalance in random digital trees

zbMATH Keywords

Mellin transformfixed pointrecurrencerandom treescontraction methodPoissonization

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Data structures (68P05)

Cited In (10)

• Renewals for exponentially increasing lifetimes, with an application to digital search trees
• Distances in random digital search trees
• Node profiles of symmetric digital search trees: Concentration properties
• The oscillatory distribution of distances in random tries
• 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6--10, 2005.
• The \(k\)-th total path length and the total Steiner \(k\)-distance for digital search trees
• On the variety of shapes in digital trees
• Imbalance in random digital trees
• Limit distribution of distances in biased random tries
• On the distribution of distances in recursive trees

This page was built for publication: Distribution of inter-node distances in digital trees

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