Abstract
Some techmques for solving recurrences are presented, along with examples of how these recurrences arise in the analysis of algorithms. In addition, probability generating functions are discussed and used to analyze problems in computer science. © 1980, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Lueker, G. S. (1980). Some Techniques for Solving Recurrences. ACM Computing Surveys (CSUR), 12(4), 419–436. https://doi.org/10.1145/356827.356832
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free