First Page | Document Content | |
---|---|---|
![]() Date: 2014-03-12 10:51:35Sorting algorithms Order theory Mathematics Computer programming Quicksort Samplesort Radix sort Burstsort Bucket sort LCP array Merge sort Trie | Add to Reading List |
![]() | Engineering Parallel String SortingDocID: 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 whoseDocID: 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,DocID: QSRz - View Document |
![]() | PDF DocumentDocID: qfn - View Document |