In-place Parallel Sorting

In-Place Parallel Sorting is a parallel sorting algorithm that belongs to the class of in-place algorithms by reusing the input data structure for output with minimal additional memory, distinguished by its simultaneous execution across multiple processing units without requiring auxiliary storage proportional to the input size.

8

Publications

245

Citations

25

Authors

11

Institutions

Publications per year

2017–2026

3

Authors

25

  1. EK
    Endrias Kahssay

    Massachusetts Institute of Technology, United States

    1 publications · 21 citations

    1

    h-index

  2. DB
    Daniël Brand

    IBM Research - Thomas J. Watson Research Center, United States

    1 publications · 45 citations

    1

    h-index

  3. JS
    Julian Shun

    Carnegie Mellon University, United States

    1 publications · 21 citations

    1

    h-index

  4. EF
    Edward Fan

    Yale University, United States

    1 publications · 21 citations

    1

    h-index

  5. UF
    Ulrich Finkler

    IBM Research - Thomas J. Watson Research Center, United States

    1 publications · 45 citations

    1

    h-index

1–5 of 25

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 13 citations

    1

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 18 citations

    1

    h-index

  3. Communications of the ACM

    1 publications · 62 citations

    1

    h-index

  4. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 45 citations

    1

    h-index

  5. Procedia Computer Science

    1 publications · 10 citations

1–5