Generalized Stack Permutations

Authors:
M. D. Atkinson
Affiliations:
School of Mathematical and Computational Sciences North Haugh, St Andrews, Fife KY16 9SS, Scotland (e-mail: mda@dcs.st-and.ac.uk)
Venue:
Combinatorics, Probability and Computing
Year:
1998

Citing 6
Cited 5

Forbidden subsequences

Discrete Mathematics
Generating trees and the Catalan and Schro¨der numbers

Discrete Mathematics
Partitioning permutations into increasing and decreasing subsequences

Journal of Combinatorial Theory Series A
Sorting Using Networks of Queues and Stacks

Journal of the ACM (JACM)
Pattern Matching for Permutations

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Computing permutations with double-ended queues, parallel stacks and parallel queues

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

Restricted permutations and the wreath product

Discrete Mathematics
Sorting with a Forklift

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On the least exponential growth admitting uncountably many closed permutation classes

Theoretical Computer Science
Sorting with networks of data structures

Discrete Applied Mathematics
An efficient programming model for memory-intensive recursive algorithms using parallel disks

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stacks which allow elements to be pushed into any of the top r positions and popped from any of the top s positions are studied. An asymptotic formula for the number un of permutations of length n sortable by such a stack is found in the cases r=1 or s=1. This formula is found from the generating function of un. The sortable permutations are characterized if r=1 or s=1 or r=s=2 by a forbidden subsequence condition.