We consider sorting procedures for permutations making use of pop stacks with a bypass operation, and explore the combinatorial properties of the associated algorithms.
Pop Stacks with a Bypass / Cioni, Lapo; Ferrari, Luca; Smith, Rebecca. - In: ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE. - ISSN 2075-2180. - ELETTRONICO. - 403:(2024), pp. 73-78. ( GASCom 2024 Bordeaux, France 24-28 giugno 2024) [10.4204/eptcs.403.17].
Pop Stacks with a Bypass
Cioni, Lapo;Ferrari, Luca;
2024
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
paper.pdf
accesso aperto
Descrizione: full paper
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Creative commons
Dimensione
201.79 kB
Formato
Adobe PDF
|
201.79 kB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
