Characterization and enumeration of preimages under the \texttt{Queuesort} algorithm
From MaRDI portal
Publication:6604701
DOI10.1007/978-3-030-83823-2_37MaRDI QIDQ6604701
Publication date: 13 September 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stack-sorting, set partitions, and Lassalle's sequence
- Average-case analysis of algorithms using Kolmogorov complexity
- Sorted and/or sortable permutations
- Descents in \(t\)-sorted permutations
- Stack sorting with restricted stacks
- Postorder Preimages
- Sorting Using Networks of Queues and Stacks
This page was built for publication: Characterization and enumeration of preimages under the \texttt{Queuesort} algorithm