Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,393,622 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
All nearest smaller values
Binary tree
Comparison sort
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Pop-stack sorting and its image: Permutations with overlapping runs
Andrei Asinowski
,
C. Banderier
,
Sara C. Billey
,
Benjamin Hackl
,
Svante Linusson
2019
Corpus ID: 199366660
Pop-stack sorting is an important variation for sorting permutations via a stack. A single iteration of pop-stack sorting is the…
Expand
2017
2017
Fighting fish and two-stack sortable permutations
Wenjie Fang
2017
Corpus ID: 55395964
In 2017, Duchi, Guerrini, Rinaldi and Schaeffer proposed a new family of combinatorial objects called "fighting fish", which are…
Expand
2014
2014
Sortable silt mean grain size of sediment core PS67/197-1
I. McCave
,
S. Crowhurst
,
G. Kuhn
,
C. Hillenbrand
,
M. Meredith
2014
Corpus ID: 132462479
2014
2014
Sortable silt mean grain size of sediment core TPC288
I. McCave
,
S. Crowhurst
,
G. Kuhn
,
C. Hillenbrand
,
M. Meredith
2014
Corpus ID: 134251854
Highly Cited
2013
Highly Cited
2013
Abrupt changes in deep Atlantic circulation during the transition to full glacial conditions
D. Thornalley
,
S. Barker
,
Julia Becker
,
I. Hall
,
G. Knorr
2013
Corpus ID: 19215240
[1] Six Ocean Drilling Program (ODP) sites, in the Northwest Atlantic have been used to investigate kinematic and chemical…
Expand
2012
2012
Methods of computing deque sortable permutations given complete and incomplete information
Dan N. Denton
arXiv.org
2012
Corpus ID: 7690634
The problem of determining which permutations can be sorted using certain switchyard networks dates back to Knuth in 1968. In…
Expand
2012
2012
Algorithms for discovering and proving theorems about permutation patterns
Hjalti Magnusson
,
Henning Úlfarsson
arXiv.org
2012
Corpus ID: 5906193
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically…
Expand
2009
2009
Tracking deep -water flow on Eirik Drift over the past 160 kyr: Linking deep-water changes to freshwater fluxes
S. Henderson
2009
Corpus ID: 128068292
Several proxy records, including mean sortable silt (SS), percent CaCO3 and stable isotopes of two planktonic species of…
Expand
Highly Cited
2003
Highly Cited
2003
Paleocurrent reconstruction of the deep Pacific inflow during the middle Miocene: Reflections of East Antarctic Ice Sheet growth
I. Hall
,
I. N. McCave
,
R. Zahn
,
L. Carter
,
P. Knutz
,
G. Weedon
2003
Corpus ID: 13871608
[1] Today the deep western boundary current (DWBC) east of New Zealand is the most important route for deep water entering the…
Expand
1998
1998
Multi-statistic enumeration of two-stack sortable permutations
M. Bousquet-Mélou
Electronic Journal of Combinatorics
1998
Corpus ID: 6200997
Using Zeilberger's factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE