Sorting with two ordered stacks in series

Authors:
M. D. Atkinson;M. M. Murphy;N. Ruskuc
Affiliations:
Department of Computer Science, University of Otago, Dunedin, New Zealand;School of Mathematics and Statistics, University of St. Andrews, St. Andrews, KY16 9SS UK;School of Mathematics and Statistics, University of St. Andrews, St. Andrews, KY16 9SS UK
Venue:
Theoretical Computer Science
Year:
2002

Citing 9
Cited 3

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 Mathematics
Sorting twice through a stack

Selected papers of the conference on Formal power series and algebraic combinatorics
Forbidden subsequences

Discrete Mathematics
Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations

Journal of Combinatorial Theory Series A
Classification of forbidden subsequences of length 4

European Journal of Combinatorics
Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps

Journal of Combinatorial Theory Series A
Restricted permutations

Discrete Mathematics
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
Regular Article: Enumeration of Planar Constellations

Advances in Applied Mathematics

On the least exponential growth admitting uncountably many closed permutation classes

Theoretical Computer Science
Enumeration schemes for restricted permutations

Combinatorics, Probability and Computing
Sorting with networks of data structures

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

The permutations that can be sorted by two stacks in series are considered, subject to the condition that each stack remains ordered. A forbidden characterisation of such permutations is obtained and the number of permutations of each length is determined by a generating function.