Divide And Conquer

Divide and Conquer is an algorithmic paradigm that solves a problem by recursively breaking it into smaller subproblems of the same type, solving each subproblem independently, and combining their solutions to form the solution to the original problem.

89

Publications

4.3K

Citations

171

Authors

92

Institutions

Publications per year

2017–2026

9

Authors

171

  1. JB
    Jon Bentley

    Carnegie Mellon University, United States

    3 publications · 889 citations

    3

    h-index

  2. DR
    Douglas R. Smith

    Grassland, Soil and Water Research Laboratory, United States

    3 publications · 296 citations

    3

    h-index

  3. MH
    Michel Habib

    Centre National de la Recherche Scientifique, France

    2 publications · 43 citations

    2

    h-index

  4. RD
    Roland Ducournau

    Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, France

    2 publications · 43 citations

    2

    h-index

  5. MM
    Marie-Laure Mugnier

    Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, France

    2 publications · 43 citations

    2

    h-index

1–5 of 171

Venues

  1. Information Processing Letters

    3 publications · 139 citations

    3

    h-index

  2. Information Sciences

    2 publications · 232 citations

    2

    h-index

  3. Discrete Applied Mathematics

    2 publications · 34 citations

    2

    h-index

  4. Discrete & Computational Geometry

    2 publications · 303 citations

    2

    h-index

  5. Algorithmica

    2 publications · 112 citations

    2

    h-index

1–5