Sorting with two ordered stacks in series.
type: Item
instance of: scholarly article
title: Sorting with two ordered stacks in series.
zbMATH Open document ID: 1061.68037
DOI: 10.1016/S0304-3975(01)00270-5
author: Mike Atkinson
author: N. Ruškuc
author: Maximillian M. Murphy
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 1857062
zbMATH Keywords: Stacks
zbMATH Keywords: Permutations
zbMATH Keywords: Forbidden patterns
zbMATH Keywords: Enumeration
MaRDI profile type: Publication
cites work: Restricted permutations
cites work: Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
cites work: Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
cites work: Q5585020
cites work: Enumeration of planar constellations
cites work: Forbidden subsequences
cites work: Classification of forbidden subsequences of length 4
cites work: Sorting Using Networks of Queues and Stacks
cites work: A Census of Planar Maps
cites work: Sorting twice through a stack
cites work: 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)\)!)
full work available at URL: s0304-3975(01)00270-5
OpenAlex ID: W2068458438
description: scientific article; zbMATH DE number 1857062