Pop stacks with a bypass

DOI10.4204/EPTCS.403.17MaRDI QIDQ6934114zbMATH OpenFDO

Authors Lapo Cioni, L. Ferrari, Rebecca Smith

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.403.17

zbMATH Keywords

sorting procedures for permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10)

Cites work

• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Finding regular insertion encodings for permutation classes
• scientific article; zbMATH DE number 3722110 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Pop-stacks in parallel
• Restricted permutations
• Sorted and/or sortable permutations
• The enumeration of permutations sortable by pop stacks in parallel
• The On-Line Encyclopedia of Integer Sequences
• Two-stack-sorting with pop stacks

This page was built for publication: Pop stacks with a bypass

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