Pop Stacks with a Bypass
Lapo Cioni (University of Pisa, Italy), Luca Ferrari (University of, Firenze, Italy), Rebecca Smith (SUNY Brockport)
TL;DR
This paper investigates sorting permutations using pop stacks with a bypass operation, analyzing the combinatorial properties and behaviors of the associated algorithms.
Contribution
It introduces and studies the combinatorial properties of sorting algorithms that utilize pop stacks with a bypass, a novel operation in permutation sorting.
Findings
Characterization of permutations sortable with pop stacks and bypass
Enumeration formulas for sortable permutations
Insights into the structure of algorithms with bypass operations
Abstract
We consider sorting procedures for permutations making use of pop stacks with a bypass operation, and explore the combinatorial properties of the associated algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.