Sorting via shuffles with a cut after the longest increasing prefix

DOI10.1016/J.TCS.2024.114679MaRDI QIDQ6589834zbMATH OpenFDO

Authors Lara Pudwell, Rebecca Smith

Publication date 20 August 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

shufflepermutationstacksalgorithmqueuessortingpermutation patterninsertion encoding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3492580 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• A survey of stack-sorting disciplines
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Finding regular insertion encodings for permutation classes
• Geometric grid classes of permutations
• On the growth of merges and staircases of permutation classes
• Permutation patterns in genome rearrangement problems: the reversal model
• Rational lecture hall polytopes and inflated Eulerian polynomials
• Restricted permutations
• Small superpatterns for dominance drawing
• Sorting Using Networks of Queues and Stacks
• Sorting by shuffling methods and a queue
• The enumeration of permutations sortable by pop stacks in parallel
• The insertion encoding of permutations
• Trailing the dovetail shuffle to its lair

This page was built for publication: Sorting via shuffles with a cut after the longest increasing prefix

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