Sorting via shuffles with a cut after the longest increasing prefix

DOI10.1016/J.TCS.2024.114679MaRDI QIDQ6589834FDOQ6589834

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

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

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)