Pages that link to "Item:Q2937642"
From MaRDI portal
The following pages link to The computational landscape of permutation patterns (Q2937642):
Displaying 12 items.
- Order-preserving indexing (Q294954) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Permutation reconstruction from a few large patterns (Q2049616) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem (Q2942252) (← links)
- (Q3084742) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- (Q6065422) (← links)
- Parity permutation pattern matching (Q6070786) (← links)
- Parity permutation pattern matching (Q6586663) (← links)