11 citations · 12 across the 3 of their papers we have counts for
7 papers
Sorting permutations with pattern-avoiding machines
Giulio Cerbai
In this work of thesis we introduce and study a new family of sorting devices, which we call pattern-avoiding machines. They consist of two stacks in series, equipped with a greedy…
Sorting with pattern-avoiding stacks: the -machine
Giulio Cerbai, Anders Claesson, Luca Ferrari +1
This paper continues the analysis of the pattern-avoiding sorting machines recently introduced by Cerbai, Claesson and Ferrari [CCF]. These devices consist of two stacks, through w…
Sorting Cayley permutations with pattern-avoiding machines
Giulio Cerbai
Pattern avoiding machines were recently introduced by Claesson, Ferrari and the current author to gain a better understanding of the classical -stacksort problem. In this paper…
Stack Sorting with Increasing and Decreasing Stacks
Giulio Cerbai, Lapo Cioni, Luca Ferrari
We introduce a sorting machine consisting of stacks in series: the first stacks can only contain elements in decreasing order from top to bottom, while the last one has t…
Stack sorting with restricted stacks
Giulio Cerbai, Anders Claesson, Luca Ferrari
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 addres…
Permutation patterns in genome rearrangement problems: the reversal model
Giulio Cerbai, Luca Ferrari
In the context of the genome rearrangement problem, we analyze two well known models, namely the reversal and the prefix reversal models, by exploiting the connection with the noti…