Sorting and Order Statistics

[1]  Naila Rahman,et al.  Adapting Radix Sort to the Memory Hierarchy , 2001, JEAL.

[2]  Yijie Han,et al.  Improved fast integer sorting in linear space , 2001, SODA '01.

[3]  Naila Rahman,et al.  Analysing cache effects in distribution sorting , 1999, JEAL.

[4]  Arne Andersson,et al.  Implementing radixsort , 1998, JEAL.

[5]  Per-Åke Larson,et al.  Speeding up External Mergesort , 1996, IEEE Trans. Knowl. Data Eng..

[6]  T. Hagerup,et al.  Sorting in linear time? , 1995, STOC '95.

[7]  Derick Wood,et al.  Foundations for Faster External Sorting (Extended Abstract) , 1994, FSTTCS.

[8]  Arne Andersson,et al.  A new efficient radix sort , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[10]  Jon Louis Bentley,et al.  Engineering a sort function , 1993, Softw. Pract. Exp..

[11]  Derick Wood,et al.  A survey of adaptive sorting algorithms , 1992, CSUR.

[12]  Heikki Mannila,et al.  Measures of Presortedness and Optimal Sorting Algorithms , 1985, IEEE Transactions on Computers.

[13]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[14]  Kurt Mehlhorn,et al.  Sorting and Searching (Eatcs Monographs on Theoretical Computer Science) , 1984 .

[15]  Curtis R. Cook,et al.  Best sorting algorithm for nearly sorted lists , 1980, CACM.

[16]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[19]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[20]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .