Sorting with networks of data structures
From MaRDI portal
Publication:602673
DOI10.1016/j.dam.2010.06.007zbMath1222.68121OpenAlexW2008790560MaRDI QIDQ602673
Alexander Golynski, Alejandro López-Ortiz, J. Ian Munro, Angèle M. Hamel, Therese C. Biedl
Publication date: 5 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.007
Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern matching for permutations
- Sorting twice through a stack
- 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)\)!)
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- Forbidden subsequences
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Multi-static enumeration of two-stack sortable permutations
- Hilbert polynomials in combinatorics
- Bounded capacity priority queues
- Permutations generated by token passing in graphs
- A survey of stack-sorting disciplines
- A combinatorial proof of J. West's conjecture
- Sorted and/or sortable permutations
- Symmetry and unimodality in \(t\)-stack sortable permutations
- A new class of Wilf-equivalent permutations
- Pop-stacks in parallel
- Sorting with two ordered stacks in series.
- Restricted permutations and the wreath product
- A simplicial complex of 2-stack sortable permutations
- Sorting with a forklift
- Generating trees and the Catalan and Schröder numbers
- Partitioning permutations into increasing and decreasing subsequences
- Permutations with forbidden subsequences and nonseparable planar maps
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Generalized Stack Permutations
- Counting Walks in the Quarter Plane
- Reversing trains: A turn of the century sorting problem
- The complexity of colouring circle graphs
- Sorting Using Networks of Queues and Stacks
- Restricted permutations
This page was built for publication: Sorting with networks of data structures
