Average-Case Analysis of Cousins in m-ary Tries

DOI10.1239/JAP/1222441835MaRDI QIDQ3535643zbMATH OpenOpenAlexFDO

Authors Hosam M. Mahmoud, Mark Daniel Ward

Publication date 13 November 2008

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1239/jap/1222441835

zbMATH Keywords

Mellin transformanalysis of algorithmscombinatorics on wordsrecurrencerandom treesimilarity of stringspoissonization

Mathematics Subject Classification ID

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

Recommendations

• Average profiles, from tries to suffix-trees
• On the number of 2-protected nodes in tries and suffix trees
• Towards a complete characterization of tries
• Profiles of Tries
• Some average measures in m-ary search trees

Cites work

• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• scientific article; zbMATH DE number 1545683 (Why is no real title available?)
• A century of complex Tauberian theory
• Analytical depoissonization and its applications
• Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
• Distances in random digital search trees
• Inverse auctions, injecting unique minima into random sets
• Limit distribution of distances in biased random tries
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• Mellin transforms and asymptotics: Harmonic sums
• ON CLIMBING TRIES
• The oscillatory distribution of distances in random tries

Cited in

(2)

• Analysis of swaps in radix selection
• On the variety of shapes in digital trees

This page was built for publication: Average-Case Analysis of Cousins in m-ary Tries

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