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)

Related topics

Related topics

17 relations
All nearest smaller valuesBinary treeComparison sortComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Sortable silt sontent of sediment core MD12-3432
2017
2017
Sortable silt of sediment core SO236_52-4
2017
2017
Sortable silt in sediment core GIK18517-2
2016
2016
Sortable silt paleo-current proxies of sediment core GeoB13862-1 from the Southwest Atlantic
2014
2014
Sortable silt mean grain size of sediment core PS67/186-1
2014
2014
Sortable silt mean grain size of sediment core PS67/197-1
2009
2009
Tracking deep -water flow on Eirik Drift over the past 160 kyr: Linking deep-water changes to freshwater fluxes
Several proxy records, including mean sortable silt (SS), percent CaCO3 and stable isotopes of two planktonic species of… 
2009
2009
Variability in ISOW vigor over the last 1300 years and its relationship to climate
Resolving the scale and origins of recent low frequency (decadal-centennial) climate variations, such as the AMO, is crucial for… 
2008
2008
Stack sorting, trees, and pattern avoidance
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation… 
2000
2000
22. LATE QUATERNARY TEXTURAL CHANGE OFFSHORE OF POINT CONCEPTION, SITE 1017, CENTRAL CALIFORNIA MARGIN 1
Siliciclastic sedimentation at Ocean Drilling Program Site 1017 on the southern slope of the Santa Lucia Bank, central California… 
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)