Measures of Presortedness and Optimal Sorting Algorithms
From MaRDI portal
Publication:3219783
DOI10.1109/TC.1985.5009382zbMATH Open0556.68031MaRDI QIDQ3219783FDOQ3219783
Publication date: 1985
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Recommendations
Cited In (35)
- Computing inversion pair cardinality through partition-based sorting
- On compressing permutations and adaptive sorting
- Sorting shuffled monotone sequences
- Arranging \(n\) distinct numbers on a line or a circle to reach extreme total variations
- Title not available (Why is that?)
- Badness of Serial Fit Revisited
- Title not available (Why is that?)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- A note on adaptive parallel sorting
- Adaptive sorting: an information theoretic perspective
- Randomized adaptive sorting
- A framework for adaptive sorting
- Sublinear merging and natural mergesort
- Encroaching lists as a measure of presortedness
- Presorting algorithms: an average-case point of view
- Title not available (Why is that?)
- An optimal parallel adaptive sorting algorithm
- Computing and ranking measures of presortedness
- Recursive merge sort with erroneous comparisons
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
- A new measure of presortedness
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- Title not available (Why is that?)
- 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∗
- Sorting roughly sorted sequences in parallel
- The multilevel principle applied to sorting
- Splitsort -- an adaptive sorting algorithm
- Title not available (Why is that?)
- Partial Solution and Entropy
- 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
- A framework for adaptive sorting
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)
