Multiway Merging

Multiway Merging is a divide-and-conquer algorithmic technique that extends the merging step of sorting algorithms by simultaneously combining more than two sorted sequences into a single sorted output, distinguished from binary merging by its ability to integrate multiple ordered inputs in a single pass.

25

Publications

1K

Citations

70

Authors

32

Institutions

Publications per year

2017–2026

3

Variants

Multi-way Merging

Authors

70

  1. PS
    Peter Sanders

    Karlsruhe Institute of Technology, Germany

    2 publications · 68 citations

    2

    h-index

  2. YC
    Yen-Kuang Chen

    Intel (United States), United States

    1 publications · 228 citations

    1

    h-index

  3. TB
    Timo Bingmann

    Karlsruhe Institute of Technology, Germany

    1 publications · 45 citations

    1

    h-index

  4. KJ
    K. Jetto

    Mohammed V University, Morocco

    1 publications · 12 citations

    1

    h-index

  5. PV
    Peter Varman

    Rice University, United States

    1 publications · 25 citations

    1

    h-index

1–5 of 70

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 2 publications · 276 citations

    2

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 56 citations

    2

    h-index

  3. 1

    h-index

  4. 1

    h-index

  5. 1

    h-index

1–5