Exploiting few inversions when sorting: Sequential and parallel algorithms
From MaRDI portal
Recommendations
Cites work
- A framework for adaptive sorting
- A guided tour of Chernoff bounds
- A note on adaptive parallel sorting
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Adaptive Heapsort
- An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
- An optimal parallel adaptive sorting algorithm
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Axioms and hulls
- Expected time bounds for selection
- scientific article; zbMATH DE number 4062610 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 3635512 (Why is no real title available?)
- Measures of Presortedness and Optimal Sorting Algorithms
- Parallel Merge Sort
- Smoothsort's behavior on presorted sequences
- Smoothsort, an alternative for sorting in situ
- Sorting in \(c \log n\) parallel steps
- Sorting roughly sorted sequences in parallel
- Splitsort -- an adaptive sorting algorithm
Cited in
(8)- An introduction to three algorithms for sorting in situ
- An optimal parallel adaptive sorting algorithm
- Inversions in \(k\)-sorted permutations
- Presorting algorithms: an average-case point of view
- Comparing algorithms for sorting with t stacks in series
- Counting inversions adaptively
- Adaptive sorting: an information theoretic perspective
- scientific article; zbMATH DE number 4090817 (Why is no real title available?)
This page was built for publication: Exploiting few inversions when sorting: Sequential and parallel algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365941)
