General combinatorial schemas: Gaussian limit distributions and exponential tails
Open Access
- 28 April 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 114 (1-3) , 159-180
- https://doi.org/10.1016/0012-365x(93)90364-y
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functionsJournal of Computational and Applied Mathematics, 1992
- Automatic average-case analysis of algorithmsTheoretical Computer Science, 1991
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- Gaussian limiting distributions for the number of components in combinatorial structuresJournal of Combinatorial Theory, Series A, 1990
- Some methods for computing component distribution probabilities in relational structuresDiscrete Mathematics, 1987
- A logical approach to asymptotic combinatorics I. First order propertiesAdvances in Mathematics, 1987
- An asymptotic formula for the exponential polynomials and a central limit theorem for their coefficientsDiscrete Mathematics, 1985
- Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functionsJournal of Combinatorial Theory, Series A, 1983
- Central and local limit theorems for the coefficients of polynomials of binomial typeJournal of Combinatorial Theory, Series A, 1977
- Central and local limit theorems applied to asymptotic enumerationJournal of Combinatorial Theory, Series A, 1973