Sorting Operators
Sorting Operators is a mathematical framework within the study of permutation patterns that characterizes systematic procedures for transforming permutations into canonical forms through well-defined operations, distinguished by their focus on pattern-avoiding or pattern-containment behaviors during the sorting process.
114
Publications
4.1K
Citations
225
Authors
128
Institutions
Publications per year
2017–2026
10
Parents
114
1–5 of 114
225
4
h-index
3
h-index
Laboratoire Bordelais de Recherche en Informatique, France
3 publications · 109 citations
3
h-index
2
h-index
2
h-index
1–5 of 225
128
Stanford University
Stanford, United States
6 h-index
13 publications
553 citations

Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
642 citations
University of Florida
Gainesville, United States
4 h-index
4 publications
192 citations
Université de Bordeaux
Bordeaux, France
4 h-index
4 publications
127 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
56 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
4 publications
62 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
3 h-index
7 publications
76 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
3 h-index
4 publications
100 citations
1–8 of 128
Repository · 5 publications · 109 citations
5
h-index
5 publications · 144 citations
5
h-index
5 publications · 197 citations
5
h-index
4 publications · 82 citations
4
h-index
4 publications · 117 citations
4
h-index
1–5