<--- Back to Details
First PageDocument Content
Sorting algorithms / Order theory / Mathematics / Computer programming / Quicksort / Samplesort / Radix sort / Burstsort / Bucket sort / LCP array / Merge sort / Trie
Date: 2014-03-12 10:51:35
Sorting algorithms
Order theory
Mathematics
Computer programming
Quicksort
Samplesort
Radix sort
Burstsort
Bucket sort
LCP array
Merge sort
Trie

Engineering Parallel String Sorting

Add to Reading List

Source URL: panthema.net

Download Document from Source Website

File Size: 553,52 KB

Share Document on Facebook

Similar Documents

Engineering Parallel String Sorting

Engineering Parallel String Sorting

DocID: 1qbRC - View Document

Engineering Burstsort: Toward Fast In-Place String Sorting RANJAN SINHA and ANTHONY WIRTH The University of Melbourne  Burstsort is a trie-based string sorting algorithm that distributes strings into small buckets whose

Engineering Burstsort: Toward Fast In-Place String Sorting RANJAN SINHA and ANTHONY WIRTH The University of Melbourne Burstsort is a trie-based string sorting algorithm that distributes strings into small buckets whose

DocID: 1mrTX - View Document

HAT-trie: A Cache-conscious Trie-based Data Structure for Strings Nikolas Askitis Ranjan Sinha  School of Computer Science and Information Technology,

HAT-trie: A Cache-conscious Trie-based Data Structure for Strings Nikolas Askitis Ranjan Sinha School of Computer Science and Information Technology,

DocID: QSRz - View Document

PDF Document

DocID: qfn - View Document