Sorting shuffled monotone sequences
From MaRDI portal
Publication:1327388
DOI10.1006/inco.1994.1050zbMath0806.68030MaRDI 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
Related Items
Unnamed Item, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, On compressing permutations and adaptive sorting, Efficient fully-compressed sequence representations, Splitsort -- an adaptive sorting algorithm, An unfeasible matching problem, Sorting multisets stably in minimum space, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, A framework for adaptive sorting, Adaptive sorting: an information theoretic perspective, From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures, Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations