A complexity calculus for recursive tree algorithms

@article{Flajolet1987ACC,
  title={A complexity calculus for recursive tree algorithms},
  author={Philippe Flajolet and Jean-Marc Steyaert},
  journal={Mathematical systems theory},
  year={1987},
  volume={19},
  pages={301-331}
}
We study a restricted programming language over tree structures. For this language, we give systematic translation rules which map programs into complexity descriptors. The descriptors are in the form of generating functions of average costs. Such a direct approach avoids recourse to recurrences; it therefore simplifies the task of analyzing algorithms in the class considered and permits analysis of structurally complex programs. It also allows a clear discussion of analytic properties of… CONTINUE READING