Average-Case Analysis of Cousins in m-ary Tries

DOI10.1239/JAP/1222441835zbMATH Open1157.05022OpenAlexW2030466202MaRDI QIDQ3535643FDOQ3535643

Mark Daniel Ward, Hosam M. Mahmoud

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)

Cites Work

• Title not available (Why is that?)
• Mellin transforms and asymptotics: Harmonic sums
• Title not available (Why is that?)
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• Analytical depoissonization and its applications
• Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
• A century of complex Tauberian theory
• The oscillatory distribution of distances in random tries
• ON CLIMBING TRIES
• Limit distribution of distances in biased random tries
• Distances in random digital search trees
• Title not available (Why is that?)
• Inverse auctions

Cited In (2)

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

   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 👍 👎

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)