Searching for "Implementing Radixsort." – sorted by Relevance.
-
Implementing Radixsort
- Implementing Radixsort Arne Andersson Department of Computer Science, Lund University Box 118, S
- Cited by 10 (1 self) – Add To MetaCart
-
Categories and Subject Descriptors: F.2.2 [Theory of Computation]: Nonnumerical Algorithms and Problems
- . Implementing Radixsort Arne Andersson Lund University and Stefan Nilsson Helsinki University of Technology We
- Add To MetaCart
-
External Memory Algorithms and Data Structures Fall 2001 GSB/RF October 2, 2001
- multiway Mergesort in external memory. 4. Implement Radixsort in external memory. 5. Compare
- Add To MetaCart
-
Sorting on a Massively Parallel System Using a Library of Basic Primitives: Modeling and Experimental Results
- We present a comparative study of implementations of the following sorting algorithms on the Parsytec
- Cited by 6 (1 self) – Add To MetaCart
-
201–290. Elsevier Science Publishing, 2000.
- . Nilsson. Implementing radixsort. J. Exp. Algorithmics, 3:7, 1998. [6] D. L. Applegate, R. E. Bixby, and W
- Add To MetaCart
-
Evaluating the XMT Parallel Programming Model
- implementations of radixsort and quicksort take advantage of fine-grained parallelism. For more regular
- Add To MetaCart
-
Evaluating the XMT Parallel Programming Model
- applications may benefit. As an example, in section 5.4 we describe how our implementations of radixsort
- Add To MetaCart

