Data-specific analysis of string sorting

MaRDI QIDQ5417706zbMATH OpenFDO

Authors Raimund Seidel

Publication date 22 May 2014

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1559569
• Using random sampling to build approximate tries for efficient string sorting
• External String Sorting: Faster and Cache-Oblivious
• Towards a realistic analysis of some popular sorting algorithms
• A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms

Cited in

(5)

• Towards a realistic analysis of the QuickSelect algorithm
• Using random sampling to build approximate tries for efficient string sorting
• Towards a realistic analysis of some popular sorting algorithms
• Upper tail analysis of bucket sort and random tries
• Upper tail analysis of bucket sort and random tries

This page was built for publication: Data-specific analysis of string sorting

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