Measures of Presortedness and Optimal Sorting Algorithms
From MaRDI portal
Recommendations
Cited in
(40)- On compressing permutations and adaptive sorting
- Computing inversion pair cardinality through partition-based sorting
- A framework for adaptive sorting
- Sorting shuffled monotone sequences
- Arranging \(n\) distinct numbers on a line or a circle to reach extreme total variations
- scientific article; zbMATH DE number 437573 (Why is no real title available?)
- Galloping in fast-growth natural merge sorts
- Badness of Serial Fit Revisited
- scientific article; zbMATH DE number 140492 (Why is no real title available?)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- From time to space: fast algorithms that yield small and fast data structures
- A note on adaptive parallel sorting
- Adaptive sorting: an information theoretic perspective
- Randomized adaptive sorting
- Adaptive shivers sort: an alternative sorting algorithm
- A framework for adaptive sorting
- Encroaching lists as a measure of presortedness
- Presorting algorithms: an average-case point of view
- Sublinear merging and natural mergesort
- An optimal parallel adaptive sorting algorithm
- Computing and ranking measures of presortedness
- Recursive merge sort with erroneous comparisons
- A new measure of presortedness
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- scientific article; zbMATH DE number 4155867 (Why is no real title available?)
- Analysis of consensus sorting via the cycle metric
- Analysis of consensus sorting via the cycle metric
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- An adaptive generic sorting algorithm that uses variable partitioning∗
- Splitsort -- an adaptive sorting algorithm
- Sorting roughly sorted sequences in parallel
- The multilevel principle applied to sorting
- A general method for improving insertion-based adaptive sorting
- scientific article; zbMATH DE number 3943040 (Why is no real title available?)
- Partial Solution and Entropy
- On the worst-case complexity of TimSort
- Right invariant metrics and measures of presortedness
- Measures of distinctness for random partitions and compositions of an integer
- On partitions and presortedness of sequences
- A selectable sloppy heap
This page was built for publication: Measures of Presortedness and Optimal Sorting Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219783)
