Engineering burstsort, toward fast in-place string sorting
From MaRDI portal
Publication:5406232
Recommendations
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)