Adaptive sorting: an information theoretic perspective (original) (raw)
Related papers
Adaptive Sorting and the Information Theoretic Lower Bound
Lecture Notes in Computer Science, 2003
Inversion-sensitive sorting algorithms in practice
Journal of Experimental Algorithmics, 2009
Sorting N-Elements Using Natural Order: A New Adaptive Sorting Approach
Journal of Computer Science, 2010
A survey of adaptive sorting algorithms
ACM Computing Surveys, 1992
Sorting by Restricted-Length-Weighted Reversals
Genomics, Proteomics & Bioinformatics, 2005
Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm
2020
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms, 2008
Comparison of Sorting Algorithms based on Input Sequences
International Journal of Computer Applications, 2013
Bidirectional Expansion – Insertion Algorithm for Sorting
Approximation Algorithm for Sorting by Reversals and Transpositions
2007
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences, 2008
Enhanced Insertion Sort Algorithm
On compressing permutations and adaptive sorting
Theoretical Computer Science, 2013
Sorting by Prefix Reversals and Prefix Transpositions with Forward March
Fast string sorting using order-preserving compression
ACM Journal of Experimental Algorithms, 2005
Performance Comparison of Sorting Algorithms On The Basis Of Complexity
Future Generation Computer Systems, 2017
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O (nlogn) Time
WALCOM: Algorithms and …, 2010
The technique of in-place associative sorting
An O ( n 3 / 2 log ( n ) ) algorithm for sorting by reciprocal translocations
Journal of Discrete Algorithms, 2011
Presorting algorithms: An average-case point of view
Theoretical Computer Science, 2000
NeatSort - A practical adaptive algorithm
2014
A Comprehensive Note on Complexity Issues in Sorting Algorithms
2009
An Empirical Study for Inversions-Sensitive Sorting Algorithms
Lecture Notes in Computer Science, 2005
A Novel In-Place Sorting Algorithm with O(n log z) Comparisons and O(n log z) Moves
2008
Efficient Sort Using Modified Binary Search-a New Way to Sort
2013
An (18/11)n upper bound for sorting by prefix reversals
Theoretical Computer Science, 2009
International Journal For Technological Research In Engineering, 2013
In-place sorting with fewer moves
Information Processing Letters, 1999
Sorting Signed Permutations by Inversions in O ( n log n ) Time
Journal of Computational Biology, 2010
MSL: An Efficient Adaptive In-Place Radix Sort Algorithm
Lecture Notes in Computer Science, 2004