Stack-sortable permutation

In mathematics and computer science, a stack-sortable permutation (also called a tree permutation) is a permutation whose elements may be sorted by… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2013
0119932013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 7
  • figure 8
Is this relevant?
2011
2011
Pattern avoidance in the symmetric group Sn has provided a number of useful connections between seemingly unrelated problems from… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2008
2008
We analyzed a varved sequence of sediment from a 350-m depth in the north basin of Lake Malawi, East Africa, for the size… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2008
2008
We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
The Late Oligocene to Recent Canterbury Drifts were deposited in water depths between c. 400 and c. 1500 m by northward-flowing… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1993
1993
West, J., Sorting twice through a stack, Theoretical Computer Science 117 (1993) 303-313 We consider the operation of stack… (More)
Is this relevant?