Stable Sorting

Stable Sorting is a sorting algorithm that preserves the relative order of elements with equal keys in the sorted output as they appeared in the input sequence.

14

Publications

365

Citations

38

Authors

23

Institutions

Publications per year

2017–2026

2

Authors

38

  1. OS
    Omar S. Akbari

    University of California San Diego, United States

    1 publications · 21 citations

    1

    h-index

  2. TP
    Tomi Pasanen

    University of Copenhagen, Denmark

    1 publications · 22 citations

    1

    h-index

  3. AN
    Ariel Nof

    Bar-Ilan University, Israel

    1 publications · 36 citations

    1

    h-index

  4. JM
    Joachim M. Buhmann

    ETH Zurich, Switzerland

    1 publications · 13 citations

    1

    h-index

  5. MA
    Michael A. Langston

    University of Tennessee at Knoxville, United States

    1 publications · 29 citations

    1

    h-index

1–5 of 38

Venues

  1. Journal of the ACM

    JACM · 1 publications · 20 citations

    1

    h-index

  2. Software Practice and Experience

    1 publications · 13 citations

    1

    h-index

  3. GEN Biotechnology

    1 publications · 21 citations

    1

    h-index

  4. The Computer Journal

    1 publications · 29 citations

    1

    h-index

  5. 1

    h-index

1–5