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

DOI10.1007/978-3-030-83823-2_37MaRDI QIDQ6604701FDOQ6604701

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

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sorting Using Networks of Queues and Stacks
• Sorted and/or sortable permutations
• Descents in \(t\)-sorted permutations
• Stack sorting with restricted stacks
• Postorder Preimages
• Stack-sorting, set partitions, and Lassalle's sequence
• Average-case analysis of algorithms using Kolmogorov complexity

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)