๐ฎ
๐ฎ
The Ethereal
Pop Stacks with a Bypass
June 24, 2024 ยท The Ethereal ยท ๐ International Conference on Random and Exhaustive Generation of Combinatorial Structures
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Lapo Cioni, Luca Ferrari, Rebecca Smith
arXiv ID
2406.16399
Category
cs.DM: Discrete Mathematics
Cross-listed
cs.DS
Citations
0
Venue
International Conference on Random and Exhaustive Generation of Combinatorial Structures
Last Checked
5 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Discrete Mathematics
๐ฎ
๐ฎ
The Ethereal
An Introduction to Temporal Graphs: An Algorithmic Perspective
๐ฎ
๐ฎ
The Ethereal
Guarantees for Greedy Maximization of Non-submodular Functions with Applications
๐ฎ
๐ฎ
The Ethereal
A note on the triangle inequality for the Jaccard distance
๐ฎ
๐ฎ
The Ethereal
Fast clique minor generation in Chimera qubit connectivity graphs
๐ฎ
๐ฎ
The Ethereal