We present new improved algorithms for the sorting problem. The algorithms are not only eecient but also clear and simple. First, we introduce Forward Radix Sort which combines the advantages of traditional left-to-right and right-to-left radix sort in a simple manner. We argue that this algorithm will work very well in practice. Adding a preprocessing step, we obtain an algorithm with attracti...

Membrane proteins that are tagged with ubiquitin are diverted from the secretory pathway into lysosomes. New work shows that it is the GGA proteins that initiate sorting in the Golgi, and suggests that similar principles apply to multiple sorting steps.

As XML finds its place in information technology, query languages for XML attract much attention. Among them XPath is the most known. This article reveals a surprising fact that the upcoming XPath 2.0 is capable of sorting sequences, which is proved formally. We also mark out an incompleteness of XQuery Core and an insufficiency of definition of XQuery Core sorting semantics. The fact that XPat...

We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU Bucket Sort) is not only considerably faster than the best comparison-based sorting algorithm for GPUs (Thrust Merge [Satish et.al., Proc. IPDPS 2009]) but also as fast as randomized sample sort for GPUs (GPU Sample Sort [Leischner et.al., Proc. IPDPS 2010]). However, deterministic sample sort has the advantage that ...