Algorithms
File structures: an analytic approach
File structures: an analytic approach
Merging sorted runs using large main memory
Acta Informatica
Introduction to algorithms
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Software—Practice & Experience
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Journal of Computer and System Sciences
Journal of Experimental Algorithmics (JEA)
Best sorting algorithm for nearly sorted lists
Communications of the ACM
Improved fast integer sorting in linear space
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM
Analysing cache effects in distribution sorting
Journal of Experimental Algorithmics (JEA)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Speeding Up External Mergesort
IEEE Transactions on Knowledge and Data Engineering
Asymptotic analysis of an optimized quicksort algorithm
Information Processing Letters
Foundations for Faster External Sorting (Extended Abstract)
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
External Sorting: Run Formation Revisited
IEEE Transactions on Knowledge and Data Engineering
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
Efficient sorting using registers and caches
Journal of Experimental Algorithmics (JEA)
Adapting Radix Sort to the Memory Hierarchy
Journal of Experimental Algorithmics (JEA)
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
The number of bit comparisons used by Quicksort: an average-case analysis
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)
Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)
Cache-efficient string sorting using copying
Journal of Experimental Algorithmics (JEA)
Engineering a cache-oblivious sorting algorithm
Journal of Experimental Algorithmics (JEA)
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |