Sorting with a popqueue

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

Authors: Lapo Cioni, L. Ferrari 

Publication date: 7 June 2024

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

Recommendations

• Preimages under a popqueue-sorting algorithm
• A stack and pop stack in series
• Sorting by shuffling methods and a queue
• Pop-stack sorting and its image: permutations with overlapping runs
• Two-stack-sorting with pop stacks

zbMATH Keywords

permutationspattern avoidancesortingpopqueue

Mathematics Subject Classification ID

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

Cites Work

• The on-line encyclopedia of integer sequences
• Théorie géométrique des polynômes eulériens
• Title not available (Why is that?)
• Sorting Using Networks of Queues and Stacks
• Generating trees and forbidden subsequences
• 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 with restricted stacks
• Two-stack-sorting with pop stacks
• Stack-sorting, set partitions, and Lassalle's sequence
• 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
• Enumerating permutations sortable by \(k\) passes through a pop-stack

Cited In (2)

• A new lower bound for deterministic pop-stack-sorting
• Pop-stack sorting and its image: permutations with overlapping runs

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)