Pages that link to "Item:Q1327388"
From MaRDI portal
The following pages link to Sorting shuffled monotone sequences (Q1327388):
Displaying 13 items.
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Splitsort -- an adaptive sorting algorithm (Q1182101) (← links)
- An unfeasible matching problem (Q1182611) (← links)
- Sorting multisets stably in minimum space (Q1338888) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- A framework for adaptive sorting (Q1891925) (← links)
- Adaptive sorting: an information theoretic perspective (Q2480779) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process (Q2942262) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
