Pages that link to "Item:Q2480779"
From MaRDI portal
The following pages link to Adaptive sorting: an information theoretic perspective (Q2480779):
Displaying 12 items.
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Computing inversion pair cardinality through partition-based sorting (Q956693) (← links)
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
- Inversions in \(k\)-sorted permutations (Q1270771) (← links)
- Sorting shuffled monotone sequences (Q1327388) (← links)
- Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
- Counting inversions adaptively (Q2348707) (← links)
- Sorting under partial information (without the ellipsoid algorithm) (Q2439837) (← links)
- Algorithms – ESA 2004 (Q5464614) (← links)
- Efficient Sorting in a Dynamic Adverse-Selection Model (Q5706647) (← links)
- Experimental and Efficient Algorithms (Q5710063) (← links)
- Automata, Languages and Programming (Q5716809) (← links)
