Pop-stacks in parallel

DOI10.1016/S0020-0190(99)00049-6zbMATH Open1002.68030OpenAlexW2018996635WikidataQ62037485 ScholiaQ62037485MaRDI QIDQ1606930FDOQ1606930

Michael D. Atkinson, Jörg-Rüdiger Sack

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00049-6

Recommendations

• The enumeration of permutations sortable by pop stacks in parallel
• \(k\)-pop stack sortable permutations and \(2\)-avoidance
• A stack and pop stack in series
• Two-stack-sorting with pop stacks
• Counting Pop-Stacked Permutations in Polynomial Time

zbMATH Keywords

pop-stacks

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (11)

• Enumerating permutations sortable by \(k\) passes through a pop-stack
• The enumeration of permutations sortable by pop stacks in parallel
• Counting Pop-Stacked Permutations in Polynomial Time
• Sorting with networks of data structures
• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Foot-sorting for socks
• Deterministic stack-sorting for set partitions
• Title not available (Why is that?)
• Two-stack-sorting with pop stacks
• Pop-stack sorting and its image: permutations with overlapping runs
• Partition and composition matrices

This page was built for publication: Pop-stacks in parallel

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