Pop Stacks with a Bypass
<|reference_start|>Pop Stacks with a Bypass: We consider sorting procedures for permutations making use of pop stacks with a bypass operation, and explore the combinatorial properties of the associated algorithms.<|reference_end|>
@article{cioni2024pop,
    title={Pop Stacks with a Bypass},
    author={Lapo Cioni (University of Pisa, Italy), Luca Ferrari (University of
  Firenze, Italy), Rebecca Smith (SUNY Brockport)},
    journal={EPTCS 403, 2024, pp. 73-78},
    year={2024},
    doi={10.4204/EPTCS.403.17},
    archivePrefix={arXiv},
    eprint={2406.16399},
    primaryClass={cs.DM cs.DS}
}