Results 31 to 40 of about 344,156 (265)
Stack-based sorting algorithms [PDF]
Journal of Systems and Software, 1989 The emergence of stacks as a hardware device in stack machines implies the recognition of the importance of using stacks in different computer applications and the need to make use of them in others. This paper uses stacks to solve the sorting problem. Two stack-based sorting algorithms are introduced.
openaire +1 more source
Pop-stack-sorting for Coxeter groups
Combinatorial Theory, 2022 24 pages, 7 figures, to be published in Combinatorial ...
openaire +6 more sources
Preimages Under the Stack-Sorting Algorithm [PDF]
Graphs and Combinatorics, 2016 We use a method for determining the number of preimages of any permutation under the stack-sorting map in order to obtain recursive upper bounds for the numbers $W_t(n)$ and $W_t(n,k)$ of $t$-stack sortable permutations of length $n$ and $t$-stack sortable permutations of length $n$ with exactly $k$ descents.
openaire +2 more sources
Supplement to “Consolidity: Moving opposite to built-as-usual systems practices”
Ain Shams Engineering Journal, 2013 A new updated conceptual systems change pathway graph for natural and man-made built-as-usual physical systems is developed following a joint two-level event-driven (or activity-driven) and time-driven framework.
Hassen Taher Dorrah
doaj +1 more source
, 2022 Z-stack through adult heart cells stained with Lamin A/C and ...
Matt Stroud (12212456)
core +1 more source
Stack-sorting, set partitions, and Lassalle's sequence
Journal of Combinatorial Theory, Series A, 2020 We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new combinatorial interpretations of Lassalle's sequence.
Colin Defant +2 more
openaire +4 more sources
Sorting with two stacks in parallel [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutations that can be sorted using a stack. He also showed that they are in bijection with Dyck paths and thus counted by the Catalan numbers. Subsequently, Pratt and Tarjan asked about permutations that can be sorted using two stacks in parallel.
Albert, Michael +1 more
openaire +3 more sources
Sorting with two ordered stacks in series
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mike D. Atkinson +2 more
openaire +3 more sources
FEBS Letters, EarlyView.Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura +2 more
wiley +1 more source
, 2006 Claudia Stack reflects on her professional life in higher education. She spent 17 years in higher education, with 14 years at UNCW. Ms. Stack taught in the Watson School of Education and later worked as an academic advisor for General College (now ...
Stack, Claudia
core +2 more sources