Recurrence relations are equations that describe how a function depends on its previous values. They are often used to analyze the running time and space complexity of recursive algorithms.

The running times of our algorithms are derived from an asymptotic analysis of a broad class of two-variable recurrence relations. Our main theorem gives a simple formula for this asymptotics. The ...