How many pop-stacks does it take to sort a permutation?
From MaRDI portal
Abstract: Pop-stacks are variants of stacks that were introduced by Avis and Newborn in 1981. Coincidentally, a 1982 result of Unger implies that every permutation of length n can be sorted by n-1 passes through a deterministic pop-stack. We give a new proof of this result inspired by Knuth's zero-one principle.
This page was built for publication: How many pop-stacks does it take to sort a permutation?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355678)
