In-place Sorting

In-Place Sorting is a sorting algorithm that belongs to the class of algorithms performing reorganization of elements within a fixed data structure, distinguished by its use of only a constant amount of additional memory space apart from the input array.

14

Publications

351

Citations

25

Authors

18

Institutions

Publications per year

2017–2026

4

Authors

25

  1. GF
    Gianni Franceschini

    University of Pisa, Italy

    3 publications · 58 citations

    3

    h-index

  2. JK
    Jyrki Katajainen

    University of Copenhagen, Denmark

    2 publications · 80 citations

    2

    h-index

  3. TP
    Tomi Pasanen

    University of Copenhagen, Denmark

    2 publications · 80 citations

    2

    h-index

  4. VG
    Viliam Geffert

    University of Pavol Jozef Šafárik, Slovakia

    2 publications · 38 citations

    2

    h-index

  5. WH
    Wai Hong Chan

    Sun Yat-sen University, China

    1 publications · 20 citations

    1

    h-index

1–5 of 25

Venues

  1. 1

    h-index

  2. 1

    h-index

  3. IEEE Transactions on Signal Processing

    1 publications · 47 citations

    1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 20 citations

    1

    h-index

  5. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 18 citations

    1

    h-index

1–5