M. H. Albert and M. D. Atkinson, Simple permutations and pattern restricted permutations, Discrete Mathematics, vol.300, issue.1-3, pp.1-15, 2005.
DOI : 10.1016/j.disc.2005.06.016

URL : http://doi.org/10.1016/j.disc.2005.06.016

M. H. Albert, M. D. Atkinson, and M. Klazar, The enumeration of simple permutations, J. Integer Seq, vol.6, 2003.

M. H. Albert, S. Linton, and N. Ru?kuc, The insertion encoding of permutations, Electron. J. Combin, vol.12, issue.47, p.31, 2005.

F. Bassino, M. Bouvel, A. Pierrot, and D. Rossin, Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial, Pure Mathematics and Applications, vol.21, issue.2, pp.119-135, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00459647

F. Bassino, M. Bouvel, A. Pierrot, and D. Rossin, A polynomial algorithm for deciding the finiteness of the number of simple permutations contained in permutation classes, 2011.

P. Bose, J. F. Buss, and A. Lubiw, Pattern matching for permutations, Information Processing Letters, vol.65, issue.5, pp.277-283, 1998.
DOI : 10.1016/S0020-0190(97)00209-3

M. Bousquet-mélou, Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels, Electron. J. Combin, vol.9, issue.2, 2002.

R. Brignall, A survey of simple permutations, Permutation Patterns, pp.41-65, 2010.
DOI : 10.1017/CBO9780511902499.003

R. Brignall, S. Huczynska, and V. Vatter, Simple permutations and algebraic generating functions, Journal of Combinatorial Theory, Series A, vol.115, issue.3, pp.423-441, 2008.
DOI : 10.1016/j.jcta.2007.06.007

R. Brignall, N. Ru?kuc, and V. Vatter, Simple permutations: Decidability and unavoidable substructures, Theoretical Computer Science, vol.391, issue.1-2, pp.150-163, 2008.
DOI : 10.1016/j.tcs.2007.10.037

URL : http://doi.org/10.1016/j.tcs.2007.10.037

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.4-5577, 2004.
DOI : 10.1109/WSC.2011.6147745

URL : https://hal.archives-ouvertes.fr/hal-00654267

S. Elizalde, Statistics on pattern-avoiding permutations, 2004.

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655

URL : https://hal.archives-ouvertes.fr/inria-00072739

S. Kitaev and T. Mansour, A survey on certain pattern problems. Preprint available at http://www.ru.is/kennarar/sergey, 2003.

D. E. Knuth, Fundamental Algorithms, volume 1 of The Art of Computer Programming, 1973.

A. Pierrot and D. Rossin, Simple permutation poset, 2012.

V. Vatter, Enumeration Schemes for Restricted Permutations, Combinatorics, Probability and Computing, vol.9, issue.01, pp.137-159, 2008.
DOI : 10.1016/S0012-365X(96)83023-8