Parallel Divide-and-conquer Algorithms

Parallel Divide-And-Conquer Algorithms is a computational strategy that belongs to the class of divide-and-conquer algorithms and is distinguished by its simultaneous execution of recursive subproblems across multiple processing units to exploit concurrency in problem decomposition and solution composition.

178

Publications

8.5K

Citations

434

Authors

201

Institutions

Publications per year

2017–2026

28

Variants

Parallel Divide And Conquer Algorithms

Authors

434

  1. CL
    Christian Lengauer

    University of Passau, Germany

    4 publications · 87 citations

    4

    h-index

  2. CH
    Christoph Herrmann

    Technische Universität Braunschweig, Germany

    4 publications · 101 citations

    4

    h-index

  3. CE
    Charles E. Leiserson

    Massachusetts Institute of Technology, United States

    4 publications · 114 citations

    4

    h-index

  4. RC
    Rezaul Chowdhury

    The University of Texas at Austin, United States

    4 publications · 150 citations

    4

    h-index

  5. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    4 publications · 194 citations

    4

    h-index

1–5 of 434

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 186 citations

    5

    h-index

  2. SIAM Journal on Scientific Computing

    5 publications · 306 citations

    5

    h-index

  3. Parallel Processing Letters

    5 publications · 120 citations

    5

    h-index

  4. IEEE Transactions on Computers

    4 publications · 178 citations

    4

    h-index

  5. Parallel Computing

    4 publications · 90 citations

    4

    h-index

1–5