Pages that link to "Item:Q1763485"
From MaRDI portal
The following pages link to Parallel algorithms for separable permutations (Q1763485):
Displaying 8 items.
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- The Möbius function of separable and decomposable permutations (Q640846) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- (Q5089220) (← links)
- (Q6065422) (← links)
