The enumeration of permutations sortable by pop stacks in parallel

DOI10.1016/j.ipl.2009.02.014zbMath1214.68143OpenAlexW2061501202MaRDI QIDQ987841

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

zbMATH Keywords

algorithmssortingpermutationdata structuresinsertion encodingpop stack

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Data structures (68P05)

Related Items (4)

Partition and composition matrices ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Two-stack-sorting with pop stacks

Cites Work

• Pop-stacks in parallel
• Restricted permutations and the wreath product
• The insertion encoding of permutations
• Sorting Using Networks of Queues and Stacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The enumeration of permutations sortable by pop stacks in parallel