论文标题
排列置换需要多少流行堆？
How many pop-stacks does it take to sort a permutation?
论文作者
论文摘要
流行堆栈是Avis和Newborn于1981年引入的堆栈的变体。恰恰是1982年，Unger的结果暗示，长度为N的每个置换都可以通过N-1的N-1分类，可以通过确定性的流行堆栈。我们为此结果提供了新的证据，灵感来自Knuth的零原则。
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.
