1. Ahal, S., Rabinovich, Y.: On complexity of the subpattern problem. SIAM JDM 22(2), 629–649 (2008)
2. Lecture Notes in Computer Science;MH Albert,2001
3. Albert, M.H., Lackner, M.-L., Lackner, M., Vatter, V.: The complexity of pattern matching for 321-avoiding and skew-merged permutations. DMTCS 18(2) (2016)
4. Atkinson, M.D.: Permutations which are the union of an increasing and a decreasing. EJC 5, 263–273 (1998)
5. Baik, J., Deift, P., Johansson, K.: On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12, 1119–1178 (1999)