Pages that link to "Item:Q290212"
From MaRDI portal
The following pages link to Finding pattern matchings for permutations (Q290212):
Displaying 18 items.
- Pattern matching for permutations (Q293263) (← links)
- Order-preserving indexing (Q294954) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- Indexing permutations for binary strings (Q407548) (← links)
- Sub-quadratic time and linear space data structures for permutation matching in binary strings (Q414411) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Constructing separable Arnold snakes of Morse polynomials (Q2025699) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- On the longest upsequence problem for permutations (Q2731076) (← links)
- AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993) (← links)
- Average-Case Analysis of Perfect Sorting by Reversals (Q3637122) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- (Q5089220) (← links)
- (Q6065422) (← links)
