The following pages link to Pattern matching for permutations (Q293263):
Displaying 50 items.
- Order-preserving indexing (Q294954) (← links)
- Order-preserving pattern matching with \(k\) mismatches (Q294955) (← 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)
- Product decompositions of the symmetric group induced by separable permutations (Q412251) (← links)
- Sub-quadratic time and linear space data structures for permutation matching in binary strings (Q414411) (← links)
- Operators of equivalent sorting power and related Wilf-equivalences (Q463051) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- The Möbius function of separable and decomposable permutations (Q640846) (← links)
- Separable \(d\)-permutations and guillotine partitions (Q659578) (← links)
- A polyominoes-permutations injection and tree-like convex polyominoes (Q662025) (← links)
- Determinantal formulas for SEM expansions of Schubert polynomials (Q825966) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- The solution of a conjecture of Stanley and Wilf for all layered patterns (Q1279660) (← links)
- The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size! (Q1356119) (← links)
- Permutations avoiding certain patterns: The case of length 4 and some generalizations (Q1377745) (← links)
- The Brownian limit of separable permutations (Q1660630) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
- A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- On the least exponential growth admitting uncountably many closed permutation classes (Q1885903) (← links)
- On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation (Q1930607) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Separable elements and splittings of Weyl groups (Q2006095) (← links)
- On the growth of the Möbius function of permutations (Q2010617) (← links)
- Constructing separable Arnold snakes of Morse polynomials (Q2025699) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Interval posets of permutations (Q2088077) (← links)
- Unknotted cycles (Q2088688) (← links)
- The feasible regions for consecutive patterns of pattern-avoiding permutations (Q2099462) (← links)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- Sorting by shuffling methods and a queue (Q2161211) (← links)
- On the poset of non-attacking King permutations (Q2178672) (← links)
- Separable elements in Weyl groups (Q2280364) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- On the topology of the permutation pattern poset (Q2347966) (← links)
- A bijection between permutations and floorplans, and its applications (Q2499588) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- Unsplittable classes of separable permutations (Q2629491) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Permutations encoding the local shape of level curves of real polynomials via generic projections (Q2675335) (← links)
- On the longest upsequence problem for permutations (Q2731076) (← links)
- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem (Q2942252) (← links)
- Edit distance between unlabeled ordered trees (Q3423140) (← links)
