Master Theorem

The Master Theorem is a theorem in the analysis of algorithms that provides an asymptotic characterization of recurrence relations arising from divide-and-conquer algorithms by specifying the solution based on the relationship between the work done at each level and the rate of subproblem reduction.

67

Publications

3.1K

Citations

111

Authors

86

Institutions

Publications per year

2017–2026

12

Authors

111

  1. SS
    Salomon Sickert

    Technical University of Munich, Germany

    4 publications · 66 citations

    4

    h-index

  2. JK
    Jan Křetínský

    Technical University of Munich, Germany

    4 publications · 66 citations

    4

    h-index

  3. JE
    Javier Esparza

    Technical University of Munich, Germany

    4 publications · 66 citations

    4

    h-index

  4. AF
    A. Fuliński

    Institute of Physics, Poland

    3 publications · 131 citations

    3

    h-index

  5. NK
    Niels Keiding

    University of Copenhagen, Denmark

    2 publications · 193 citations

    2

    h-index

1–5 of 111

Venues

  1. Physica

    5 publications · 912 citations

    5

    h-index

  2. arXiv (Cornell University)

    Repository · 5 publications · 67 citations

    5

    h-index

  3. Journal of Statistical Physics

    4 publications · 354 citations

    4

    h-index

  4. Journal of the ACM

    JACM · 3 publications · 96 citations

    3

    h-index

  5. SIAM Journal on Mathematical Analysis

    3 publications · 79 citations

    3

    h-index

1–5