Pages that link to "Item:Q2890993"
From MaRDI portal
The following pages link to Average-case analysis of perfect sorting by reversals (Q2890993):
Displaying 7 items.
- A decorated tree approach to random permutations in substitution-closed classes (Q782811) (← links)
- Efficient sample sort and the average case analysis of PEsort (Q861251) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- On the average number of reversals needed to sort signed permutations (Q1682880) (← links)
- Some families of trees arising in permutation analysis (Q2185210) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- A note on average-case sorting (Q5965138) (← links)