A class of sorting algorithms based on Quicksort
Communications of the ACM - Lecture notes in computer science Vol. 174
Combinatorics, complexity, and randomness
Communications of the ACM
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Communications of the ACM
File structures: an analytic approach
File structures: an analytic approach
A new measure of presortedness
Information and Computation
Roughly sorting: sequential and parallel approach
Journal of Information Processing
Merging sorted runs using large main memory
Acta Informatica
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
A note on adaptive parallel sorting
Information Processing Letters
A parallel version of Cook and Kim's algorithm for presorted lists
Software—Practice & Experience
Sublinear merging and natural merge sort
SIGAL '90 Proceedings of the international symposium on Algorithms
Analysis of the expected search cost in skip lists
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Sorting shuffled monotone sequences
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Local insertion sort revisited
Proceedings of the international symposium on Optimal 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.)
An optimal parallel adaptive sorting algorithm
Information Processing Letters
Splitsort—an adaptive sorting algorithm
Information Processing Letters
On partitions and presortedness of sequences
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Sorting and measures of disorder
Sorting and measures of disorder
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM (JACM)
A List Insertion Sort for Keys With Arbitrary Key Distribution
ACM Transactions on Mathematical Software (TOMS)
Best sorting algorithm for nearly sorted lists
Communications of the ACM
Communications of the ACM
Parallel Sorting Algorithms
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
A Framework for Adaptive Sorting
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Heapsort - Adapted for Presorted Files
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
On Optimal Parallel Algorithm for Sorting Presorted Files
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 4th GI-Conference on Theoretical Computer Science
Historical Searching and Sorting
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Gprof: A call graph execution profiler
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Memory management during run generation in external sorting
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Adaptive intersection and t-threshold problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Priority Queues, Pairing, and Adaptive Sorting
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Adaptive Sorting and the Information Theoretic Lower Bound
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Experiments on Adaptive Set Intersections for Text Retrieval Systems
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Acceleration of sweep-line technique by employing smart quicksort
Information Sciences—Informatics and Computer Science: An International Journal
A framework for adaptive algorithm selection in STAPL
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Improved output-sensitive snap rounding
Proceedings of the twenty-second annual symposium on Computational geometry
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Theoretical Computer Science
Estimating the output cardinality of partial preaggregation with a measure of clusteredness
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
ACM Transactions on Algorithms (TALG)
Cross-disciplinary perspectives on meta-learning for algorithm selection
ACM Computing Surveys (CSUR)
Bulk-Insertion Sort: Towards Composite Measures of Presortedness
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Adaptive algorithms for planar convex hull problems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Algorithms and theory of computation handbook
Adaptive stable marriage algorithms
Proceedings of the 48th Annual Southeast Regional Conference
Proceedings of the VLDB Endowment
Recursive merge sort with erroneous comparisons
Discrete Applied Mathematics
SIAM Journal on Computing
Faster adaptive set intersections for text searching
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Sorting by merging or merging by sorting?
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Cache-aware and cache-oblivious adaptive sorting
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Semantic compression of TCP traces
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Which sort orders are interesting?
The VLDB Journal — The International Journal on Very Large Data Bases
Tradeoffs between branch mispredictions and comparisons for sorting algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
An empirical study for inversions-sensitive sorting algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Resilient algorithms and data structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Edit distance to monotonicity in sliding windows
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Sort-sharing-aware query processing
The VLDB Journal — The International Journal on Very Large Data Bases
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Hi-index | 0.00 |
The design and analysis of adaptive sorting algorithms has made important contributions to both theory and practice. The main contributions from the theoretical point of view are: the description of the complexity of a sorting algorithm not only in terms of the size of a problem instance but also in terms of the disorder of the given problem instance; the establishment of new relationships among measures of disorder; the introduction of new sorting algorithms that take advantage of the existing order in the input sequence; and, the proofs that several of the new sorting algorithms achieve maximal (optimal) adaptivity with respect to several measures of disorder. The main contributions from the practical point of view are: the demonstration that several algorithms currently in use are adaptive; and, the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences. In this survey, we present the basic notions and concepts of adaptive sorting and the state of the art of adaptive sorting algorithms.