J. Bandlow and K. Killpatrick, An area-to-inv bijection between Dyck paths and 312-avoiding permutations , Elect, J. Combin, vol.8, p.40, 2001.

A. Claesson, S. Kitaev, and E. Steingrímsson, Stack sorting, trees, and pattern avoidance

I. P. Goulden and J. West, Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations, Journal of Combinatorial Theory, Series A, vol.75, issue.2, pp.200-242, 1996.
DOI : 10.1006/jcta.1996.0074

S. Elizalde and E. Deutsch, A Simple and Unusual Bijection for Dyck Paths and its Consequences, Annals of Combinatorics, vol.7, issue.3, pp.281-297, 2003.
DOI : 10.1007/s00026-003-0186-y

S. Elizalde and I. Pak, Bijections for refined restricted permutations, Journal of Combinatorial Theory, Series A, vol.105, issue.2, pp.207-219, 2004.
DOI : 10.1016/j.jcta.2003.10.009

D. E. Knuth, The art of computer programming, Vol. I Fundamental algorithms, 1969.

D. E. Knuth, The art of computer programming, 1973.

C. Krattenthaler, Permutations with Restricted Patterns and Dyck Paths, Advances in Applied Mathematics, vol.27, issue.2-3, pp.510-530, 2001.
DOI : 10.1006/aama.2001.0747

T. Mansour, E. Deng, and R. Du, Dyck paths and restricted permutations, Discrete Applied Mathematics, vol.154, issue.11, pp.1593-1605, 2006.
DOI : 10.1016/j.dam.2006.02.004
URL : http://doi.org/10.1016/j.dam.2006.02.004

A. Reifegerste, A generalization of Simion-Schmidt's bijection for restricted permutations, Electron. J. Combin, vol.9, issue.9, p.pp. (electronic), 2002.

D. Richards, Ballot sequences and restricted permutations, Ars Combin, vol.25, pp.83-86, 1988.

A. Robertson, D. Saracino, and D. Zeilberger, Refined Restricted Permutations, Annals of Combinatorics, vol.6, issue.3, pp.427-444, 2003.
DOI : 10.1007/s000260200015

D. Rotem, On a correspondence between binary trees and a certain type of permutation, Information Processing Letters, vol.4, issue.3, pp.58-61, 1975.
DOI : 10.1016/0020-0190(75)90002-2

R. Simion and F. W. Schmidt, Restricted Permutations, European Journal of Combinatorics, vol.6, issue.4, pp.383-406, 1985.
DOI : 10.1016/S0195-6698(85)80052-4

J. West, Permutation trees and the Catalan and Schröder numbers Discrete Math, pp.247-262, 1995.

D. Zeilberger, A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length n is 2(3n)!/((n+1)!(2n+1)!), Discrete Math, pp.85-93, 1992.