Characterization and enumeration of preimages under the \texttt{Queuesort} algorithm

DOI10.1007/978-3-030-83823-2_37MaRDI QIDQ6604701zbMATH OpenFDO

Authors Lapo Cioni, L. Ferrari

Publication date 13 September 2024

zbMATH Keywords

permutationCatalan numbersballot numberspreimagesorting algorithmderangement numbersQueuesort

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Average-case analysis of algorithms using Kolmogorov complexity
• Descents in \(t\)-sorted permutations
• Postorder Preimages
• Sorted and/or sortable permutations
• Sorting Using Networks of Queues and Stacks
• Stack sorting with restricted stacks
• Stack-sorting, set partitions, and Lassalle's sequence
• The On-Line Encyclopedia of Integer Sequences

This page was built for publication: Characterization and enumeration of preimages under the \texttt{Queuesort} algorithm

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