The following pages link to A framework for adaptive sorting (Q1891925):
Displaying 21 items.
- Chunky and equal-spaced polynomial multiplication (Q540329) (← links)
- On partitions and presortedness of sequences (Q808689) (← links)
- Efficient sample sort and the average case analysis of PEsort (Q861251) (← links)
- Splitsort -- an adaptive sorting algorithm (Q1182101) (← links)
- Presorting algorithms: an average-case point of view (Q1575533) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- The analysis of evolutionary algorithms on sorting and shortest paths problems (Q1774629) (← links)
- A new measure of presortedness (Q1822995) (← links)
- Adaptive search over sorted sets (Q2253912) (← links)
- Sublinear merging and natural mergesort (Q2366243) (← links)
- Adaptive sorting: an information theoretic perspective (Q2480779) (← links)
- Generating nearly sorted sequences -- the use of measures of disorder (Q2845518) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Extensible Datasort Refinements (Q2988653) (← links)
- (Q3359741) (← links)
- Randomized adaptive sorting (Q4034707) (← links)
- Adaptive Heapsort (Q4696648) (← links)
- Adaptive linear list reorganization under a generalized query system (Q4858685) (← links)
- A framework for adaptive sorting (Q5056160) (← links)
- Adaptive Shivers Sort: An Alternative Sorting Algorithm (Q5146879) (← links)
- Efficient Sorting in a Dynamic Adverse-Selection Model (Q5706647) (← links)
