\def\cprime{$'$}
\begin{thebibliography}{10}

\bibitem{albert:longest-subsequ:}
{\sc Albert, M.~H., Aldred, R. E.~L., Atkinson, M.~D., van Ditmarsch, H.~P.,
  Handley, B.~D., Handley, C.~C., and Opatrny, J.}
\newblock Longest subsequences in permutations.
\newblock {\em Australas. J. Combin. 28\/} (2003), 225--238.

\bibitem{albert:on-the-wilf-sta:}
{\sc Albert, M.~H., Elder, M., Rechnitzer, A., Westcott, P., and Zabrocki, M.}
\newblock On the {W}ilf-{S}tanley limit of $4231$-avoiding permutations and a
  conjecture of {A}rratia.
\newblock {\em Adv. in Appl. Math. 36}, 2 (2006), 95--105.

\bibitem{albert:growing-at-a-pe:}
{\sc Albert, M.~H., and Linton, S.}
\newblock Growing at a perfect speed.
\newblock Preprint.

\bibitem{arratia:on-the-stanley-:}
{\sc Arratia, R.}
\newblock On the {S}tanley-{W}ilf conjecture for the number of permutations
  avoiding a given pattern.
\newblock {\em Electron. J. Combin. 6\/} (1999), Note, N1, 4 pp.

\bibitem{atkinson:sorting-with-tw:}
{\sc Atkinson, M.~D., Murphy, M.~M., and Ru{\v{s}}kuc, N.}
\newblock Sorting with two ordered stacks in series.
\newblock {\em Theoret. Comput. Sci. 289}, 1 (2002), 205--223.

\bibitem{babson:generalized-per:}
{\sc Babson, E., and Steingr{\'{\i}}msson, E.}
\newblock Generalized permutation patterns and a classification of the
  {M}ahonian statistics.
\newblock {\em S\'em. Lothar. Combin. 44\/} (2000), Article B44b, 18 pp.

\bibitem{babson:the-permutation:}
{\sc Babson, E., and West, J.}
\newblock The permutations $123p\sb 4\cdots p\sb m$ and $321p\sb 4\cdots p\sb
  m$ are {W}ilf-equivalent.
\newblock {\em Graphs Combin. 16}, 4 (2000), 373--380.

\bibitem{backelin:wilf-equivalenc:}
{\sc Backelin, J., West, J., and Xin, G.}
\newblock Wilf-equivalence for singleton classes.
\newblock {\em Adv. in Appl. Math. 38}, 2 (2007), 133--148.

\bibitem{bona:exact-enumerati:}
{\sc B{\'o}na, M.}
\newblock Exact enumeration of {$1342$}-avoiding permutations: a close link
  with labeled trees and planar maps.
\newblock {\em J. Combin. Theory Ser. A 80}, 2 (1997), 257--272.

\bibitem{bona:a-survey-of-sta:}
{\sc B{\'o}na, M.}
\newblock A survey of stack-sorting disciplines.
\newblock {\em Electron. J. Combin. 9}, 2 (2003), Article 1, 16 pp.

\bibitem{bona:the-limit-of-a-:}
{\sc B{\'o}na, M.}
\newblock The limit of a {S}tanley-{W}ilf sequence is not always rational, and
  layered patterns beat monotone patterns.
\newblock {\em J. Combin. Theory Ser. A 110}, 2 (2005), 223--235.

\bibitem{burstein:dumont-permutat:}
{\sc Burstein, A., and Stromquist, W.}
\newblock Dumont permutations of the third kind.
\newblock Preprint.

\bibitem{elder:problems-and-co:}
{\sc Elder, M., and Vatter, V.}
\newblock Problems and conjectures presented at the {T}hird {I}nternational
  {C}onference on {P}ermutation {P}atterns, {U}niversity of {F}lorida, {M}arch
  7--11, 2005.
\newblock arXiv:math.CO/0505504.

\bibitem{hardarson:avoidance-of-pa:}
{\sc Hardarson, M.~T.}
\newblock Avoidance of partially ordered generalized patterns of the form
  $k$-$\sigma$-$k$.
\newblock arXiv:0805.1872v1, 2008.

\bibitem{marcus:excluded-permut:}
{\sc Marcus, A., and Tardos, G.}
\newblock Excluded permutation matrices and the {S}tanley-{W}ilf conjecture.
\newblock {\em J. Combin. Theory Ser. A 107}, 1 (2004), 153--160.

\bibitem{ray:posets-of-matri:}
{\sc Ray, N., and West, J.}
\newblock Posets of matrices and permutations with forbidden subsequences.
\newblock {\em Ann. Comb. 7}, 1 (2003), 55--88.

\bibitem{regev:asymptotic-valu:}
{\sc Regev, A.}
\newblock Asymptotic values for degrees associated with strips of {Y}oung
  diagrams.
\newblock {\em Adv. in Math. 41}, 2 (1981), 115--136.

\bibitem{schensted:longest-increas:}
{\sc Schensted, C.}
\newblock Longest increasing and decreasing subsequences.
\newblock {\em Canad. J. Math. 13\/} (1961), 179--191.

\bibitem{stankova:a-new-class-of-:}
{\sc Stankova, Z., and West, J.}
\newblock A new class of {W}ilf-equivalent permutations.
\newblock {\em J. Algebraic Combin. 15}, 3 (2002), 271--290.

\bibitem{stankova:forbidden-subse:}
{\sc Stankova, Z.~E.}
\newblock Forbidden subsequences.
\newblock {\em Discrete Math. 132}, 1-3 (1994), 291--316.

\bibitem{west:permutations-wi:}
{\sc West, J.}
\newblock {\em Permutations with forbidden subsequences and stack-sortable
  permutations}.
\newblock PhD thesis, M.I.T., 1990.

\bibitem{west:sorting-twice-t:}
{\sc West, J.}
\newblock Sorting twice through a stack.
\newblock {\em Theoret. Comput. Sci. 117}, 1-2 (1993), 303--313.

\end{thebibliography}