- last revision March 16, 1995; file:"log.tex" 4/24/2003 Log-Concavity and Related Properties of the Cycle Index Polynomials
- 0 1 Laws for Maps Edward A. Bender1, Kevin J. Compton2, L. Bruce Richmond3
- Intersections of Randomly Embedded Sparse Graphs are Poisson Edward A. Bender
- TEXed on 1 21 1999 Almost All Rooted Maps Have Large Representativity
- Journal of Combinatorial Theory, Series A 107 (2004) 117125 Asymptotics of combinatorial structures with
- The map asymptotics constant tg Edward A. Bender
- The Fraction of Subspaces of GFqn with a Speci ed Number of Minimal Weight Vectors is Asymptotically Poisson
- Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls
- /res/papers/maps/FDEG.TEX 4/24/2003 The number of degree restricted rooted maps on the sphere
- Locally Restricted Compositions I. Restricted Adjacent Differences
- Asymptotic enumeration of labelled graphs by genus Edward A. Bender
- Asymptotics of Some Convolutional Recurrences Edward A. Bender
- Locally Restricted Compositions II. General Restrictions and Infinite Matrices
- Coefficients of Functional Compositions Often Grow Smoothly
- A Discontinuity in the Distribution of Fixed Point Sums
- Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
- Multivariate Asymptotics for Products of Large Powers
- A Multivariate Lagrange Inversion Formula for Asymptotic Calculations
- Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks
- The asymptotic number of labeled graphs n vertices, q edges, and no isolated vertices
- Admissible Functions and Asymptotics for Labelled Structures by Number of Components
- /Rod, July 17, 1991; file "acg2.tex" 4/24/2003 Asymptotic Properties of Labeled Connected Graphs
- Seminaire Lotharingien de Combinatoire 52 (2004), Article B50h Irreducible compositions
- Submap Density and Asymmetry Results for Two Parameter Map Families