The enumeration of permutations sortable by pop stacks in parallel
From MaRDI portal
Publication:987841
DOI10.1016/J.IPL.2009.02.014zbMATH Open1214.68143OpenAlexW2061501202MaRDI QIDQ987841FDOQ987841
Authors: J. Martínez 
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.014
Recommendations
Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Data structures (68P05) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting Using Networks of Queues and Stacks
- Title not available (Why is that?)
- Restricted permutations and the wreath product
- The insertion encoding of permutations
- Title not available (Why is that?)
- Pop-stacks in parallel
Cited In (14)
- Permutations sortable by two stacks in parallel and quarter plane walks
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Sorting via shuffles with a cut after the longest increasing prefix
- Counting Pop-Stacked Permutations in Polynomial Time
- Pop-stacks in parallel
- Efficient methods of calculating the number of heapable permutations
- Title not available (Why is that?)
- Enumerating permutations sortable by \(k\) passes through a pop-stack
- Permutations sortable by deques and by two stacks in parallel
- Permutations sortable by two stacks in parallel and quarter plane walks
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
- Two-stack-sorting with pop stacks
- Pop-stack sorting and its image: permutations with overlapping runs
- Partition and composition matrices
This page was built for publication: The enumeration of permutations sortable by pop stacks in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987841)
