scientific article; zbMATH DE number 5763326

MaRDI QIDQ3576773zbMATH OpenFDO

Authors Costas A. Christophi, Hosam M. Mahmoud

Publication date 2 August 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0123/0.html

zbMATH Keywords

Mellin transformrecurrencerandom treessingularity analysisdigital treespoissonizationdepoissonization

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40) Computer aspects of numerical algorithms (65Y99)

Recommendations

• On The variance of the extremal path length in a symmetric digital trie
• One-sided variations on binary search trees
• scientific article; zbMATH DE number 1775397
• On the randomness complexity of efficient sampling
• On the average depth of asymmetric LC-tries
• The power of slightly more than one sample in randomized load balancing

Cited in

(3)

• ON CLIMBING TRIES
• Imbalance in random digital trees
• Limit distribution of distances in biased random tries

This page was built for publication:

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