scientific article; zbMATH DE number 3492580

MaRDI QIDQ4074820zbMATH OpenFDO

Authors Vaughan R. Pratt

Publication date 1973

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99) Programming involving graphs or networks (90C35)

Cited in

(36)

• Permutations generated by token passing in graphs
• Regular closed sets of permutations.
• Generating permutations with restricted containers
• On the least exponential growth admitting uncountably many closed permutation classes
• Finding and counting permutations via CSPs
• Pattern avoidance of \([4,k]\)-pairs in circular permutations
• An infinite antichain of planar tanglegrams
• Sorting by shuffling methods and a queue
• Deque automata, languages, and planar graph representations
• Stieltjes moment sequences for pattern-avoiding permutations
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• Passing through a stack \(k\) times with reversals
• Inflations of geometric grid classes of permutations
• Pattern matching for permutations
• Permutations sortable by deques and by two stacks in parallel
• Signed enumeration of upper-right corners in path shuffles
• Permutations sortable by two stacks in parallel and quarter plane walks
• Passing through a stack k times
• Operators of equivalent sorting power and related Wilf-equivalences
• Labelled well-quasi-order for permutation classes
• Pattern matching for permutations
• Two-stack-sorting with pop stacks
• An exact characterization of saturation for permutation matrices
• Restricted permutations
• Permutations of a multiset avoiding permutations of length 3
• Priority queues with binary priorities
• Sorting with networks of data structures
• Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
• An antichain of monomial ideals in a twisted commutative algebra
• Sorting with a popqueue
• Sorting via shuffles with a cut after the longest increasing prefix
• Sorting twice through a stack
• Improving order with queues
• Counting permutation patterns with multidimensional trees
• The enumeration of permutations sortable by pop stacks in parallel
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074820)