Preimages under the Queuesort algorithm
From MaRDI portal
Publication:1981689
DOI10.1016/j.disc.2021.112561zbMath1472.05005arXiv2102.07628OpenAlexW3192615413MaRDI QIDQ1981689
Publication date: 6 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.07628
Related Items
Uses Software
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
- Troupes, cumulants, and stack-sorting
- Descents in \(t\)-sorted permutations
- Fertility monotonicity and average complexity of the stack-sorting map
- Stack sorting with restricted stacks
- Enumeration via ballot numbers
- Théorie géométrique des polynômes eulériens
- Postorder Preimages
- Sorting Using Networks of Queues and Stacks