Adaptive sorting: an information theoretic perspective
From MaRDI portal
Publication:2480779
DOI10.1007/s00236-007-0061-0zbMath1138.68030MaRDI QIDQ2480779
Amr Elmasry, Michael L. Fredman
Publication date: 3 April 2008
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-007-0061-0
68P10: Searching and sorting
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splitsort -- an adaptive sorting algorithm
- How good is the information theory bound in sorting?
- An almost optimal algorithm for unbounded searching
- A tree-based mergesort
- Sorting shuffled monotone sequences
- Exploiting few inversions when sorting: Sequential and parallel algorithms
- A new measure of presortedness
- A framework for adaptive sorting
- Sublinear merging and natural mergesort
- Measures of Presortedness and Optimal Sorting Algorithms
- Self-adjusting binary search trees
- Design and Analysis of a Data Structure for Representing Sorted Lists
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- Adaptive Heapsort