Journal of the ACM · 2001 · 57 citations · 14 references
Mathematical ProgrammingNew TheoremsEngineeringRandomized AlgorithmMaster TheoremsComputational ComplexityDivide-and-conquer RecurrencesAnalytic CombinatoricsComputer ScienceProbability TheoryDiscrete MathematicsCombinatorial OptimizationRecursive FunctionSymbolic Method (Combinatorics)Toll Functions
This paper presents new theorems to analyze divide-and-conquer recurrences, which improve other similar ones in several aspects. In particular, these theorems provide more information, free us almost completely from technicalities like floors and ceilings, and cover a wider set of toll functions and weight distributions, stochastic recurrences included.
14
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 16.9K citations
1990 · 3.1K citations
C. A. R. Hoare · The Computer Journal · 1962 · 741 citations · Full text
Mathematical Programming, Random-access Store, Engineering +14
A guided tour of chernoff bounds
Torben Hagerup, Christine Rüb · Information Processing Letters · 1990 · 522 citations
C. A. R. Hoare · Communications of the ACM · 1961 · 421 citations