Stochastic analysis of the Merge-Sort algorithm

DOI10.1002/(SICI)1098-2418(199708)11:1%3C81::AID-RSA3%3E3.0.CO;2-QMaRDI QIDQ4350886zbMATH OpenOpenAlexFDO

Authors

Publication date 4 February 1998

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199708)11:1%3C81::aid-rsa3%3E3.0.co;2-q

zbMATH Keywords

contraction methodMerge-Sort algorithm

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Searching and sorting (68P10)

Recommendations

• Stochastic Analysis of ‘Simultaneous Merge–Sort'
• scientific article; zbMATH DE number 4094834
• Publication:4888166
• scientific article; zbMATH DE number 1052336
• scientific article; zbMATH DE number 870696

Cited in

(5)

• A general limit theorem for recursive algorithms and combinatorial structures
• scientific article; zbMATH DE number 3990870 (Why is no real title available?)
• scientific article; zbMATH DE number 4094834 (Why is no real title available?)
• Stochastic Analysis of ‘Simultaneous Merge–Sort'
• scientific article; zbMATH DE number 870696 (Why is no real title available?)

This page was built for publication: Stochastic analysis of the Merge-Sort algorithm

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