Adaptive sorting: an information theoretic perspective
From MaRDI portal
Recommendations
Cites work
- A framework for adaptive sorting
- A new measure of presortedness
- A tree-based mergesort
- Adaptive Heapsort
- An almost optimal algorithm for unbounded searching
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- How good is the information theory bound in sorting?
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 3614186 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2086621 (Why is no real title available?)
- Measures of Presortedness and Optimal Sorting Algorithms
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- Self-adjusting binary search trees
- Sorting shuffled monotone sequences
- Splitsort -- an adaptive sorting algorithm
- Sublinear merging and natural mergesort
Cited in
(19)- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
- Inversions in \(k\)-sorted permutations
- Sorting shuffled monotone sequences
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- Counting inversions adaptively
- scientific article; zbMATH DE number 437573 (Why is no real title available?)
- On compressing permutations and adaptive sorting
- scientific article; zbMATH DE number 1962852 (Why is no real title available?)
- scientific article; zbMATH DE number 2163028 (Why is no real title available?)
- scientific article; zbMATH DE number 2086621 (Why is no real title available?)
- scientific article; zbMATH DE number 1444317 (Why is no real title available?)
- Inversion-sensitive sorting algorithms in practice
- Algorithms – ESA 2004
- Efficient Sorting in a Dynamic Adverse-Selection Model
- Experimental and Efficient Algorithms
- Automata, Languages and Programming
- Sorting by Merging or Merging by Sorting?
- Fragile complexity of adaptive algorithms
- Computing inversion pair cardinality through partition-based sorting
This page was built for publication: Adaptive sorting: an information theoretic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480779)
