Recommendations
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 4213426 (Why is no real title available?)
- scientific article; zbMATH DE number 4155867 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- scientific article; zbMATH DE number 3614186 (Why is no real title available?)
- scientific article; zbMATH DE number 3997796 (Why is no real title available?)
- A new measure of presortedness
- Adaptive Heapsort
- Encroaching lists as a measure of presortedness
- Exploiting partial order with Quicksort
- HISTORICAL SEARCHING
- How good is the information theory bound in sorting?
- Measures of Presortedness and Optimal Sorting Algorithms
- Smoothsort, an alternative for sorting in situ
- Sorting shuffled monotone sequences
- Sorting, trees, and measures of order
- Splitsort -- an adaptive sorting algorithm
- Sublinear merging and natural mergesort
Cited in
(25)- A framework for adaptive sorting
- Sorting by Merging or Merging by Sorting?
- Adaptive linear list reorganization under a generalized query system
- Chunky and equal-spaced polynomial multiplication
- Efficient Sorting in a Dynamic Adverse-Selection Model
- scientific article; zbMATH DE number 4213426 (Why is no real title available?)
- Generating nearly sorted sequences -- the use of measures of disorder
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Efficient sample sort and the average case analysis of PEsort
- From time to space: fast algorithms that yield small and fast data structures
- Adaptive sorting: an information theoretic perspective
- Randomized adaptive sorting
- Presorting algorithms: an average-case point of view
- Sublinear merging and natural mergesort
- Computing and ranking measures of presortedness
- Adaptive search over sorted sets
- Adaptive Heapsort
- A new measure of presortedness
- Measures of Presortedness and Optimal Sorting Algorithms
- On the adaptiveness of Quicksort
- Extensible Datasort Refinements
- A general method for improving insertion-based adaptive sorting
- Adaptive Shivers Sort: An Alternative Sorting Algorithm
- scientific article; zbMATH DE number 3943040 (Why is no real title available?)
This page was built for publication: A framework for adaptive sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891925)
