Engineering burstsort, toward fast in-place string sorting

DOI10.1145/1671970.1671978MaRDI QIDQ5406232zbMATH OpenOpenAlexFDO

Authors Ranjan Sinha, Anthony Wirth

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1671970.1671978

zbMATH Keywords

algorithmscachesortingexperimental algorithmstriesstring management

Mathematics Subject Classification ID

Searching and sorting (68P10) Algorithms on strings (68W32)

Recommendations

• Cache-efficient string sorting using copying
• Using random sampling to build approximate tries for efficient string sorting
• Cache-conscious sorting of large sets of strings with dynamic tries
• Faster suffix sorting
• External String Sorting: Faster and Cache-Oblivious

Cited in

(6)

• Using random sampling to build approximate tries for efficient string sorting
• Cache-conscious sorting of large sets of strings with dynamic tries
• Power balance and apportionment algorithms for the United States Congress
• scientific article; zbMATH DE number 5989955 (Why is no real title available?)
• Cache-efficient string sorting using copying
• Engineering parallel string sorting

This page was built for publication: Engineering burstsort, toward fast in-place string sorting

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