Improved master theorems for divide-and-conquer recurrences

Authors:
Salvador Roura
Affiliations:
Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, E-08028 Barcelona, Catalonia, Spain
Venue:
Journal of the ACM (JACM)
Year:
2001

Citing 14
Cited 8

A guided tour of Chernoff bounds

Information Processing Letters
Introduction to algorithms

Introduction to algorithms
The Profile Minimization Problem in Trees

SIAM Journal on Computing
A general method and a master theorem for divide-and-conquer recurrences with applications

Journal of Algorithms
Mellin transforms and asymptotics

Acta Informatica
Probabilistic recurrence relations

Journal of the ACM (JACM)
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
A frame for general divide-and-conquer recurrences

Information Processing Letters
General Techniques for Analyzing Recursive Algorithms with Applications

SIAM Journal on Computing
Multiple-size divide-and-conquer recurrences

ACM SIGACT News
Algorithm 65: find

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
An Improved Master Theorem for Divide-and-Conquer Recurrences

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A general method for solving divide-and-conquer recurrences

ACM SIGACT News

Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An asymptotic theory for recurrence relations based on minimization and maximization

Theoretical Computer Science
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform

Theoretical Computer Science
Efficient sample sort and the average case analysis or PEsort

Theoretical Computer Science
Updating relaxed K-d trees

ACM Transactions on Algorithms (TALG)
A real elementary approach to the master recurrence and generalizations

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
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)

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.