A survey of stack-sorting disciplines

Electronic Journal of Combinatorics

Volumn 9, Issue 2 A, 2003, Pages

  Bóna, Miklós ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042580906     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review

References (39)

1. M. H. Albert, M. D. Atkinson, Sorting with a forklift, Electronic J. Combinatorics, 9 (2), (2003), Paper R9.
2. M. D. Atkinson, Sorting permutations with networks of stacks, Technical Report TR-210 (1992), School of Computer Science, Carleton University.
3. M. D. Atkinson, M. J. Livesey, D. Tulley, Permutations generated by token passing in graphs, Theoretical Computer Science, 178 (1997), 103-118.
4. M. D. Atkinson, Generalised stack permutations, Combinatorics, Probability and Computing, 7 (1998), 239-246.
5. M. D. Atkinson, J.-R. Sack, Sorting with parallel pop-stacks, Information Processing Letters, 70 (1999), 63-67.
6. M. D. Atkinson, M. M. Murphy, N. Ruškuc, Sorting with two ordered stacks in series, Theoretical Computer Science, 289 (2002), 205-223.
7. M. D. Atkinson, T. Stitt, Restricted permutations and the wreath product, Discrete Math., 259 (2002), 19-36.
8. D. Avis, M. Newborn, On pop-stacks in series, Utilitas Mathematica, 19 (1981),129-140.
9. M. Bóna, Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar graphs, J. Combin. Theory Ser. A, 80 (1997), 257-272.
10. M. Bóna, The solution of a conjecture of Stanley and Wilf for all layered patterns. J. Combin. Theory Ser. A, 85 (1999), 96-104.
11. M. B́ona, Symmetry and Unimodality in Stack sortable permutations, J. Combin. Theory Ser. A, 98, (2002) no. 1, 201-209.
12. M. Bóna, A simplicial complex of 2-stack sortable permutations. Advances in Applied Mathematics, 29 (2002), 499-508.
13. M. Bóna, Corrigendum to Symmetry and Unimodality in Stack sortable permutations, J. Combin. Theory Ser. A, 99 (2002) no.1, 191-194.
14. P. Bose, J. F. Buss, A. Lubiw, Pattern matching for permutations, Inform. Process. Lett., 65 (1998) 277-283.
15. M. Bousquet-Melou, Multi-statistic enumeration of two-stack sortable permutations, Electronic J. Combinatorics, 5 (1998), Paper R21.
16. M. Bousquet-Melou, Sorted and/or sortable permutations, Discrete Math., 225 (2000), no. 1-3, 25-50.
17. M. Bousquet-Melou, Counting Walks in the Quarter plane, in Mathematics and Computer Science: Algorithms, trees, combinatorics and probabilities, Trends in Mathematics, Birkhauser, 2002, pp. 49-67.
18. P. Branden, The generating function of two-stack sortable permutations by descents is real-rooted. preprint.
19. F. Brenti, Hilbert polynomials in combinatorics. J. Algebraic Combin., 7 (1998),127-156.
20. F. Brenti, Unimodal, log-concave and Pólya frequency sequences in combinatorics. Mem. Amer. Math. Soc., 81 (1989), no. 413.
21. R. Cori, B. Jacquard, G. Schaeffer, Description trees for some families of planar maps, Proceedings of the 9th Conference on Formal Power Series and Algebraic Combinatorics, (Vienna, 1997), 196-208.
22. S. Dulucq. S. Gire, J. West, Permutations with forbidden subsequences and nonseparable planar maps. Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics (Florence, 1993), Discrete Math, 153 (1996), 85-103.
23. P. Edelman, V. Reiner, h-shellings and h-complexes. Adv. Math., 106 (1994), no. 1, 36-64.
24. S. Even, A. Itai, Queues, stacks and graphs, in Z. Kohavi and A. Paz, eds., Theory of Machines and Computations, Proc. Internat. Symp. on the Theory of Machines and Computations, Technion - Israel Inst. of Technol., Haifa, Israel, August 1971 (Academic Press, New York, 1971), 71-86.
25. V. Gasharov, On the Neggers-Stanley conjecture and the Eulerian polynomials, J. Combin. Theory Ser. A, 82 (1998), 134-146.
26. I. P. Goulden, J. West, Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations, J. Combin. Theory Ser. A, 75 (1996), 220-242.
27. O. Guibert, Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps. Formal power series and algebraic combinatorics (Minneapolis, MN, 1996). Discrete Math., 210 (2000), no. 1-3, 71-85.
28. O. Guibert, A combinatorial proof of J. West's conjecture. Discrete Math., 187 (1998), no. 1-3, 71-96.
29. D. E. Knuth, "The art of computer programming," volume 1, Fundamental Algorithms, Addison-Wesley, Reading, Massachusetts, 1973.
30. G. Kreweras, Sur une classe des problèmes liés au treillis des partitions d'entiers. Cahiers du B.U.R.O, 6 (1965), 5-105.
31. B. Jacquard, G. Schaeffer, A bijective census of nonseparable planar maps. J. Combin. Theory Ser. A, 83 (1998), no. 1, 1-20.
32. M. M. Murphy, Restricted permutations, antichains, atomic classes and stack sorting, PhD thesis, University of St Andrews, 2002.
33. V.R. Pratt, Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing, 5 (1973), 268-277
34. Z. Stankova, J. West, A new class of Wilf-equivalent permutations. J. Algebraic Combin., 15 (2002), no. 3, 271-290.
35. R. P. Stanley, Log-concave and unimodal sequences in algebra, combinatorics, and geometry, in "Graph Theory and Its Applications: East and West," Ann. NY Acad. Sci. , 576 (1989), 500-535.
36. R.E. Tarjan, Sorting using networks of queues and stacks, Journal of the ACM, 19 (1972), 341-346.
37. J. W. Tutte, A census of planar maps, Canadian Journal of Mathematics, 33 (1963),249-271.
38. W. Unger, The Complexity of Colouring Circle Graphs STACS'92. Proceedings., A. Finkel, Jantzen, M. (eds.), Springer, Lecture Notes in Computer Science, 577 1992,389-400.
39. J. West, Permutations with forbidden subsequences and Stack sortable permutations, PhD-thesis, Massachusetts Institute of Technology, 1990.