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

Authors

225

  1. MB
    Miklós Bóna

    University of Florida, United States

    4 publications · 192 citations

    4

    h-index

  2. CW
    Christoph Weidenbach

    Max Planck Institute for Informatics, Germany

    3 publications · 58 citations

    3

    h-index

  3. MB
    Mireille Bousquet‐Mélou

    Laboratoire Bordelais de Recherche en Informatique, France

    3 publications · 109 citations

    3

    h-index

  4. SR
    S. Rao Kosaraju

    Johns Hopkins University, United States

    2 publications · 50 citations

    2

    h-index

  5. DG
    Denis Gopan

    University of Wisconsin–Madison, United States

    2 publications · 202 citations

    2

    h-index

1–5 of 225

Venues

  1. arXiv (Cornell University)

    Repository · 5 publications · 109 citations

    5

    h-index

  2. Discrete Applied Mathematics

    5 publications · 144 citations

    5

    h-index

  3. Information Processing Letters

    5 publications · 197 citations

    5

    h-index

  4. Theoretical Computer Science

    4 publications · 82 citations

    4

    h-index

  5. Discrete Mathematics

    4 publications · 117 citations

    4

    h-index

1–5