Sorting shuffled monotone sequences

DOI10.1006/inco.1994.1050zbMath0806.68030OpenAlexW2003284543MaRDI QIDQ1327388

Ola Petersson, Christos Levcopoulos

Publication date: 13 February 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1050

zbMATH Keywords

sorting algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (13)

Sorting multisets stably in minimum space ⋮ A framework for adaptive sorting ⋮ Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process ⋮ On compressing permutations and adaptive sorting ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Efficient fully-compressed sequence representations ⋮ Splitsort -- an adaptive sorting algorithm ⋮ An unfeasible matching problem ⋮ LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋮ LRM-trees: compressed indices, adaptive sorting, and compressed permutations ⋮ Adaptive sorting: an information theoretic perspective ⋮ Multi-Finger Binary Search Trees ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures

This page was built for publication: Sorting shuffled monotone sequences