Sorting with a popqueue

DOI10.1051/ITA/2024010zbMATH Open1545.05004MaRDI QIDQ6551807

Luca Ferrari, Lapo Cioni

Publication date: 7 June 2024

Published in: RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

zbMATH Keywords

permutationssortingpattern avoidancepopqueue

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Two stacks in series: a decreasing stack followed by an increasing stack
• Sorting twice through a stack
• Stack-sorting, set partitions, and Lassalle's sequence
• Generating trees and forbidden subsequences
• Preimages under the Queuesort algorithm
• Preimages under the bubblesort operator
• Fertility numbers
• Sorting with pattern-avoiding stacks: the \(132\)-machine
• Fertility monotonicity and average complexity of the stack-sorting map
• Stack sorting with restricted stacks
• Théorie géométrique des polynômes eulériens
• The on-line encyclopedia of integer sequences
• Two-stack-sorting with pop stacks
• Sorting Using Networks of Queues and Stacks
• Enumerating permutations sortable by \(k\) passes through a pop-stack

This page was built for publication: Sorting with a popqueue

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