Engineering a sort function

Implementing radixsort

Journal of Experimental Algorithmics (JEA)

Automatic array algorithm animation in C++

SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education

Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms

Journal of Algorithms - Analysis of algorithms

Acceleration of Nonnumeric Operations Using Hardware Support for the Ordered Table Hashing Algorithms

IEEE Transactions on Computers

Asymptotic analysis of an optimized quicksort algorithm

Information Processing Letters

Practical in-place mergesort

Nordic Journal of Computing

Engineering a Lightweight Suffix Array Construction Algorithm

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Efficient trie-based sorting of large sets of strings

ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16

Efficient single-pass index construction for text databases

Journal of the American Society for Information Science and Technology

Cache-conscious sorting of large sets of strings with dynamic tries

Journal of Experimental Algorithmics (JEA)

Building a new sort function for a C library

Software—Practice & Experience

Using masks, suffix array-based data structures and multidimensional arrays to compute positional ngram statistics from corpora

MWE '03 Proceedings of the ACL 2003 workshop on Multiword expressions: analysis, acquisition and treatment - Volume 18

On Floyd and Rivest's SELECT algorithm

Theoretical Computer Science

Cache-efficient string sorting using copying

Journal of Experimental Algorithmics (JEA)

Probabilistic analysis of algorithms for the Dutch national flag problem

Theoretical Computer Science

Compression techniques for fast external sorting

The VLDB Journal — The International Journal on Very Large Data Bases

Efficient sample sort and the average case analysis or PEsort

Theoretical Computer Science

A taxonomy of suffix array construction algorithms

ACM Computing Surveys (CSUR)

Faster suffix sorting

Theoretical Computer Science

An experimental study of sorting and branch prediction

Journal of Experimental Algorithmics (JEA)

Courage in profiles

LUV '94 Papers of the fourth international conference on LISP users and vendors

On the adaptiveness of Quicksort

Journal of Experimental Algorithmics (JEA)

Improving multikey Quicksort for sorting strings with many equal elements

Information Processing Letters

Engineering the divide-and-conquer closest pair algorithm

Journal of Computer Science and Technology

Combining digital access and parallel partition for quicksort and quickselect

IWMSE '09 Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering

Self-selecting, self-tuning, incrementally optimized indexes

Proceedings of the 13th International Conference on Extending Database Technology

Experiments for algorithm engineering

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Engineering burstsort: towards fast in-place string sorting

WEA'08 Proceedings of the 7th international conference on Experimental algorithms

Adaptive sampling strategies for quickselects

ACM Transactions on Algorithms (TALG)

Sorting and order statistics

Algorithms and theory of computation handbook

The ins and outs of the probabilistic model checker MRMC

Performance Evaluation

Fast in-place integer radix sorting

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III

Engineering quicksort

Computer Languages

Average case analysis of java 7's dual pivot quicksort

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Increasing the efficiency of quicksort using a neural network based algorithm selection model

Information Sciences: an International Journal