Sorting with two ordered stacks in series

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 205-223

  Atkinson, M D ^a   Murphy, M M ^b   Ruskuc N ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Enumeration; Forbidden patterns; Permutations; Stacks

Indexed keywords

CHARACTERIZATION; FUNCTIONS; MATHEMATICAL TECHNIQUES; SORTING;

ORDERED STACKS; PERMUTATIONS;

COMPUTER SCIENCE;

EID: 0037163977     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00270-5     Document Type: Article

References (13)

1. Atkinson M.D. Restricted permutations. Discrete Math. 195:1998;27-38.
2. Bóna M. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A. 80:1997;257-272.
3. R. Cori, B. Jacquard, G. Schaeffer, Description trees for some families of planar maps, Proc. 9th Conf. on Formal Power Series and Algebraic Combinatorics, Vienna, 1997, see also http://www.liafa.jussieu.fr/cp/FPSAC/FPSAC97/ARTICLES/Schaeffer.ps.gz
4. Goulden I.P., West J. Raney paths and a combinatorial relationship between nonseparable rooted planar maps and two-stack-sortable permutations. J. Combin. Theory Ser. A. 75:1996;220-242.
5. D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming, vol. 1, 2nd ed., Addison-Wesley, Reading, MA, 1973.
6. B. Jacquard, Cartes et arbres; enumeration, generation et dessins, Ph.D. thesis, École Polytechnique, Palaiseau, 1997.
7. Bousquet-Mélou M., Schaeffer G. Enumeration of planar constellations. Adv. Appl. Math. 24:2000;337-368.
8. Stankova Z.E. Forbidden subsequences. Discrete Math. 132:1994;291-316.
9. Stankova Z.E. Classification of forbidden subsequences of length. 4 Eur. J. Combin. 17(5):1996;501-517.
10. Tarjan R.E. Sorting using networks of queues and stacks. J. Assoc. Comput. Mach. 19:1972;341-346.
11. Tutte W.T. A census of planar maps. Canad. J. Math. 15:1963;249-271.
12. West J. Sorting twice through a stack. Theoret. Comput. Sci. 117(1-2):1993;303-313.
13. Zeilberger D. A proof of Julian West's conjecture that the number of 2-stack-sortable permutations of length. n is 2 (3n)!/((2n+1)!(n+1)!) Discrete Math. 102:1992;85-93.