First Page | Document Content | |
---|---|---|
Date: 2002-11-27 21:45:31Combinatorics Burstsort Radix sort Trie Quicksort Bucket sort Hash table Merge sort Insertion sort Sorting algorithms Order theory Mathematics | Add to Reading ListSource URL: goanna.cs.rmit.edu.auDownload Document from Source WebsiteFile Size: 129,77 KBShare Document on Facebook |
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 |