Parallel Merging

Parallel Merging is a parallel algorithmic technique that belongs to the class of merging methods, distinguished by its simultaneous coordination of multiple processing units to combine two or more sorted sequences into a single sorted sequence in reduced time complexity.

55

Publications

5.5K

Citations

128

Authors

63

Institutions

Publications per year

2017–2026

9

Authors

128

  1. BR
    Balakrishna R. Iyer

    IBM (United States), United States

    3 publications · 89 citations

    3

    h-index

  2. PV
    Peter Varman

    Rice University, United States

    3 publications · 89 citations

    3

    h-index

  3. PP
    Philippos Papaphilippou

    Imperial College London, United Kingdom

    2 publications · 40 citations

    2

    h-index

  4. AP
    Anthony P. Reeves

    Cornell University, United States

    2 publications · 43 citations

    2

    h-index

  5. GR
    Gary R. Ricard

    Rice University, United States

    2 publications · 75 citations

    2

    h-index

1–5 of 128

Venues

  1. Parallel Computing

    3 publications · 132 citations

    3

    h-index

  2. IEEE Transactions on Computers

    3 publications · 217 citations

    3

    h-index

  3. Information Processing Letters

    2 publications · 121 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 1.1K citations

    2

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 53 citations

    2

    h-index

1–5