Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Structural complexity of random binary trees
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A master theorem for discrete divide and conquer recurrences
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A Master Theorem for Discrete Divide and Conquer Recurrences
Journal of the ACM (JACM)
| Hi-index | 0.00 |