Automatic average-case analysis of algorithms
- 1 February 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 79 (1) , 37-109
- https://doi.org/10.1016/0304-3975(91)90145-r
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Gaussian limiting distributions for the number of components in combinatorial structuresJournal of Combinatorial Theory, Series A, 1990
- Complexity analysis of term-rewriting systemsTheoretical Computer Science, 1989
- A logical approach to asymptotic combinatorics I. First order propertiesAdvances in Mathematics, 1987
- A complexity calculus for recursive tree algorithmsTheory of Computing Systems, 1986
- Algebraic languages and polyominoes enumerationTheoretical Computer Science, 1984
- Computer-assisted microanalysis of programsCommunications of the ACM, 1982
- Differentiably Finite Power SeriesEuropean Journal of Combinatorics, 1980
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- A note on the number of functional digraphsMathematische Annalen, 1961
- A Generalisation of Stirling's Formula.Journal für die reine und angewandte Mathematik (Crelles Journal), 1956