A framework for adaptive sorting
From MaRDI portal
Publication:1891925
DOI10.1016/0166-218X(93)E0160-ZzbMATH Open0827.68032MaRDI QIDQ1891925FDOQ1891925
Authors: Ola Petersson, Alistair Moffat 
Publication date: 6 June 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Searching and sorting (68P10) Combinatorics of partially ordered sets (06A07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting shuffled monotone sequences
- Measures of Presortedness and Optimal Sorting Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- How good is the information theory bound in sorting?
- Encroaching lists as a measure of presortedness
- Smoothsort, an alternative for sorting in situ
- A new measure of presortedness
- Title not available (Why is that?)
- Exploiting partial order with Quicksort
- Sorting, trees, and measures of order
- Sublinear merging and natural mergesort
- Splitsort -- an adaptive sorting algorithm
- Title not available (Why is that?)
- HISTORICAL SEARCHING
- Adaptive Heapsort
Cited In (25)
- Adaptive linear list reorganization under a generalized query system
- Chunky and equal-spaced polynomial multiplication
- Efficient Sorting in a Dynamic Adverse-Selection Model
- Title not available (Why is that?)
- 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
- From time to space: fast algorithms that yield small and fast data structures
- Efficient sample sort and the average case analysis of PEsort
- Adaptive sorting: an information theoretic perspective
- Randomized adaptive sorting
- Sublinear merging and natural mergesort
- Presorting algorithms: an average-case point of view
- Computing and ranking measures of presortedness
- Adaptive Heapsort
- Adaptive search over sorted sets
- A new measure of presortedness
- On the adaptiveness of Quicksort
- Measures of Presortedness and Optimal Sorting Algorithms
- Extensible Datasort Refinements
- A general method for improving insertion-based adaptive sorting
- Adaptive Shivers Sort: An Alternative Sorting Algorithm
- Title not available (Why is that?)
- A framework for adaptive sorting
- Sorting by Merging or Merging by Sorting?
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)
