Results 1 to 10 of about 344,156 (265)

Flip-sort and combinatorial aspects of pop-stack sorting [PDF]

Discrete Mathematics & Theoretical Computer Science, 2021
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present several structural,
Andrei Asinowski, Cyril Banderier, Benjamin Hackl   +2 more
doaj   +8 more sources

The order of the (123, 132)-avoiding stack sort

Enumerative Combinatorics and Applications
Let $s$ be West's deterministic stack-sorting map. A well-known result (West) is that any length $n$ permutation can be sorted with $n-1$ iterations of $s.$ In 2020, Defant introduced the notion of highly-sorted permutations -- permutations in $s^t(S_n)$ for $t \lessapprox n-1.$ In 2023, Choi and Choi extended this notion to generalized stack-sorting ...
Owen Zhang
doaj   +4 more sources

Empirical Evaluation of Unoptimized Sorting Algorithms on 8-Bit AVR Arduino Microcontrollers [PDF]

Sensors
Resource-constrained sensor nodes in Internet-of-Things (IoT) and embedded sensing applications frequently rely on low-cost microcontrollers, where even basic algorithmic choices directly impact latency, energy consumption, and memory footprint.
Julia Golonka, Filip Krużel
doaj   +2 more sources

2-Stack Sorting is Polynomial [PDF]

Theory of Computing Systems, 2017
23 ...
Dominique Rossin
exaly   +8 more sources

Enumeration of Stack-Sorting Preimages via a Decomposition Lemma [PDF]

Discrete Mathematics & Theoretical Computer Science, 2021
We give three applications of a recently-proven "Decomposition Lemma," which allows one to count preimages of certain sets of permutations under West's stack-sorting map $s$.
Colin Defant
doaj   +7 more sources

Optimized IoT protocol stack for seamless smart home communication using Random Forest-based interoperability analysis [PDF]

Scientific Reports
This paper introduces an optimised and harmonised Internet of Things (IoT) protocol stack aimed at enabling seamless device communication in smart home settings, utilising a Random Forest-based interworking analysis framework.
A. Sriram, D. Manikandan, R. Venketesan, Krishnaraj Ramaswamy   +3 more
doaj   +2 more sources

Stack-Sorting Grammar

Nordlyd: Tromsø University Working Papers on Language & Linguistics
I propose that, within local domains corresponding to extended projections, typologically possible information-neutral word orders are limited to the stack-sortable (231-avoiding) permutations of a universal head-complement-specifier linear order.
David P. Medeiros
doaj   +2 more sources

Stack-sorting with stacks avoiding vincular patterns

Discrete Mathematics
We introduce the stack-sorting map $\text{SC}_σ$ that sorts, in a right-greedy manner, an input permutation through a stack that avoids some vincular pattern $σ$. The stack-sorting maps of Cerbai et al. in which the stack avoids a pattern classically and Defant and Zheng in which the stack avoids a pattern consecutively follow as special cases.
exaly   +4 more sources

Stack-sorting with consecutive-pattern-avoiding stacks [PDF]

Advances in Applied Mathematics, 2021
We introduce consecutive-pattern-avoiding stack-sorting maps $\text{SC}_σ$, which are natural generalizations of West's stack-sorting map $s$ and natural analogues of the classical-pattern-avoiding stack-sorting maps $s_σ$ recently introduced by Cerbai, Claesson, and Ferrari.
Colin Defant, Kai Zheng
openaire   +3 more sources

Stack sorting with restricted stacks [PDF]

Journal of Combinatorial Theory, Series A, 2020
The (classical) problem of characterizing and enumerating permutations that can be sorted using two stacks connected in series is still largely open. In the present paper we address a related problem, in which we impose restrictions both on the procedure and on the stacks.
Giulio Cerbai, Anders Claesson, Luca Ferrari 0001   +2 more
openaire   +4 more sources