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
67
On the identity of three generalized master equations
Robert Zwanzig · Physica · 1964 · 714 citations
1–5 of 67
111
4
h-index
4
h-index
4
h-index
3
h-index
2
h-index
1–5 of 111
86

Centre National de la Recherche Scientifique
Paris, France
5 h-index
8 publications
220 citations

Sorbonne Université
Paris, France
3 h-index
4 publications
86 citations
Technical University of Munich
Munich, Germany
3 h-index
9 publications
168 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
5 publications
136 citations
Université Libre de Bruxelles
Brussels, Belgium
2 h-index
2 publications
69 citations

Peking University
Beijing, China
2 h-index
4 publications
117 citations
Laboratoire d'Annecy de Physique Théorique
Annecy, France
2 h-index
3 publications
83 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
2 publications
31 citations
1–8 of 86
5 publications · 912 citations
5
h-index
Repository · 5 publications · 67 citations
5
h-index
4 publications · 354 citations
4
h-index
JACM · 3 publications · 96 citations
3
h-index
3 publications · 79 citations
3
h-index
1–5