Zimmermann, P. Analysis of functions with a finite number of return values, Feb. 1992. 12 pages. 25  Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Analytic Analysis of Algorithms - Flajolet (1992) (8 citations) (Correct)
....automatic computation of counting generating functions and complexity descriptors that are cost generating functions. Zimmermann [84] has developed the necessary theory which builds on the principles of our Section 1, and he has also found a number of extensions most notably to boolean procedures [85], to some forms of composition, and to exact counting. After a solving phase, the (usually complicated) generating functions produced need to be subjected to an automatic analysis of their coefficients. Salvy [69] has developed a collection of efficient decision algorithms in the style of ....
Zimmermann, P. Analysis of functions with a finite number of return values, Feb. 1992. 12 pages. 25
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC