Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Pop-stack sorting is an important variation for sorting permutations via a stack. A single iteration of pop-stack sorting is the… 
2017
2017
In 2017, Duchi, Guerrini, Rinaldi and Schaeffer proposed a new family of combinatorial objects called "fighting fish", which are… 
Highly Cited
2013
Highly Cited
2013
[1] Six Ocean Drilling Program (ODP) sites, in the Northwest Atlantic have been used to investigate kinematic and chemical… 
2012
2012
The problem of determining which permutations can be sorted using certain switchyard networks dates back to Knuth in 1968. In… 
2012
2012
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically… 
2009
2009
Several proxy records, including mean sortable silt (SS), percent CaCO3 and stable isotopes of two planktonic species of… 
Highly Cited
2003
Highly Cited
2003
[1] Today the deep western boundary current (DWBC) east of New Zealand is the most important route for deep water entering the… 
1998
1998
Using Zeilberger's factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that…