A generalized q-binomial Vandermonde convolution. - Edward A. Bender (Discret. Math., 1971)

Enumeration of Plane Partitions. - Edward A. Bender; Donald E. Knuth (J. Comb. Theory A, 1972)

Central and Local Limit Theorems Applied to Asymptotic Enumeration. - Edward A. Bender (J. Comb. Theory A, 1973)

The asymptotic number of non-negative integer matrices with given row and column sums. - Edward A. Bender (Discret. Math., 1974)

Partitions of multisets. - Edward A. Bender (Discret. Math., 1974)

Convex n-ominoes. - Edward A. Bender (Discret. Math., 1974)

On Buckhiester's Enumeration of n x n Matrices. - Edward A. Bender (J. Comb. Theory A, 1974)

The Asymptotic Number of Labeled Graphs with Given Degree Sequences. - Edward A. Bender; E. Rodney Canfield (J. Comb. Theory A, 1978)

Asymptotic Aproximations for the Number of Fanout-Free Functions. - Edward A. Bender; Jon T. Butler (IEEE Trans. Computers, 1978)

Surveyor's Forum: A Recurrent Problem. - Edward A. Bender (ACM Comput. Surv., 1979)

The Number of Fanout-Free Functions with Various Gates. - Edward A. Bender (J. ACM, 1980)

Enumeration of connected invariant graphs. - Edward A. Bender; E. Rodney Canfield (J. Comb. Theory B, 1983)

Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions. - Edward A. Bender; L. Bruce Richmond (J. Comb. Theory A, 1983)

Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions. - Edward A. Bender; L. Bruce Richmond; S. G. Williamson (J. Comb. Theory A, 1983)

Partitions of multisets II. - Edward A. Bender; John S. Devitt; L. Bruce Richmond (Discret. Math., 1984)

An asymptotic expansion for the coefficients of some power series II: Lagrange inversion. - Edward A. Bender; L. Bruce Richmond (Discret. Math., 1984)

The asymptotic enumeration of rooted convex polyhedra. - Edward A. Bender; L. Bruce Richmond (J. Comb. Theory B, 1984)

The number of loopless planar maps. - Edward A. Bender; Nicholas C. Wormald (Discret. Math., 1985)

The Asymptotic Number of Irreducible Partitions. - Edward A. Bender; Andrew M. Odlyzko; L. Bruce Richmond (Eur. J. Comb., 1985)

A Theoretical Analysis of Backtracking in the Graph Coloring Problem. - Edward A. Bender; Herbert S. Wilf (J. Algorithms, 1985)

Some Asymptotic Bijections. - Edward A. Bender; Doron Zeilberger (J. Comb. Theory A, 1985)

Enumeration of Structured Flowcharts - Edward A. Bender; Jon T. Butler (J. ACM, 1985)

The asymptotic number of acyclic diagraphs I. - Edward A. Bender; L. Bruce Richmond; Robert W. Robinson; Nicholas C. Wormald (Comb., 1986)

The asymptotic number of rooted maps on a surface. - Edward A. Bender; E. Rodney Canfield (J. Comb. Theory A, 1986)

A generalisation of Canfield's formula. - Edward A. Bender; L. Bruce Richmond (J. Comb. Theory A, 1986)

A survey of the asymptotic behaviour of maps. - Edward A. Bender; L. Bruce Richmond (J. Comb. Theory B, 1986)

Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities. - Edward A. Bender; L. Bruce Richmond (J. Graph Theory, 1986)

Optimal Worst Case Trees. - Edward A. Bender; Cheryl E. Praeger; Nicholas C. Wormald (Acta Informatica, 1987)

The asymptotic number of tree-rooted maps on a surface. - Edward A. Bender; E. Rodney Canfield; Robert W. Robinson (J. Comb. Theory A, 1988)

The asymptotic number of acyclic digraphs, II. - Edward A. Bender; Robert W. Robinson (J. Comb. Theory B, 1988)

The asymptotic number of rooted nonseparable maps on a surface. - Edward A. Bender; Nicholas C. Wormald (J. Comb. Theory A, 1988)

Face sizes of 3-polytopes. - Edward A. Bender; E. Rodney Canfield (J. Comb. Theory B, 1989)

On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions. - Edward A. Bender; Jon T. Butler (IEEE Trans. Computers, 1989)

3-edge-connected embeddings have few singular edges. - Edward A. Bender; L. Bruce Richmond (J. Graph Theory, 1990)

The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges. - Edward A. Bender; E. Rodney Canfield; Brendan D. McKay (Random Struct. Algorithms, 1990)

Foundations of applied combinatorics. - Edward A. Bender; S. G. Williamson (Addison-Wesley, 1991)

Enumeration of Degree Restricted Rooted Maps on the Sphere. - Edward A. Bender; E. Rodney Canfield (Planar Graphs, 1991)

The number of rooted maps on an orientable surface. - Edward A. Bender; E. Rodney Canfield (J. Comb. Theory B, 1991)

The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges. - Edward A. Bender; E. Rodney Canfield; Brendan D. McKay (Australas. J Comb., 1992)

Enumeration of Subspaces by Dimension Sequence. - Edward A. Bender; Raymond Coley; David P. Robbins; Howard Rumsey Jr. (J. Comb. Theory A, 1992)

Submaps of maps. II. Cyclically k-connected planar cubic maps. - Edward A. Bender; Zhicheng Gao; William McCuaig; L. Bruce Richmond (J. Comb. Theory B, 1992)

Submaps of maps. I. General 0-1 laws. - Edward A. Bender; Zhicheng Gao; L. Bruce Richmond (J. Comb. Theory B, 1992)

Submaps of maps. III. k-Connected nonplanar maps. - Edward A. Bender; L. Bruce Richmond (J. Comb. Theory B, 1992)

Asymptotic Properties of Labeled Connected Graphs. - Edward A. Bender; E. Rodney Canfield; Brendan D. McKay (Random Struct. Algorithms, 1992)

The Distribution of Subword Counts is Usually Normal. - Edward A. Bender; Fred Kochman (Eur. J. Comb., 1993)

The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces. - Edward A. Bender; E. Rodney Canfield; L. Bruce Richmond (J. Comb. Theory A, 1993)

The Number of Degree-Restricted Rooted Maps on the Sphere. - Edward A. Bender; E. Rodney Canfield (SIAM J. Discret. Math., 1994)

Largest 4-Connected Components of 3-Connected Planar Triangulations. - Edward A. Bender; L. Bruce Richmond; Nicholas C. Wormald (Random Struct. Algorithms, 1995)

Admissible Functions and Asymptotics for Labelled Structures by Number of Components. - Edward A. Bender; L. Bruce Richmond (Electron. J. Comb., 1996)

Log-Concavity and Related Properties of the Cycle Index Polynomials. - Edward A. Bender; E. Rodney Canfield (J. Comb. Theory A, 1996)

Mathematical methods in artificial intelligence. - Edward A. Bender (IEEE, 1997)

The Fraction of Subspaces of GF(q) n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson. - Edward A. Bender; E. Rodney Canfield (Electron. J. Comb., 1997)

Submap Density and Asymmetry Results for Two Parameter Map Families. - Edward A. Bender; E. Rodney Canfield; Zhicheng Gao; L. Bruce Richmond (Comb. Probab. Comput., 1997)

The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices. - Edward A. Bender; E. Rodney Canfield; Brendan D. McKay (J. Comb. Theory A, 1997)

A Multivariate Lagrange Inversion Formula for Asymptotic Calculations. - Edward A. Bender; L. Bruce Richmond (Electron. J. Comb., 1998)

Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks. - Edward A. Bender; S. Gill Williamson (Electron. J. Comb., 1998)

Intersections of Randomly Embedded Sparse Graphs are Poisson. - Edward A. Bender; E. Rodney Canfield (Electron. J. Comb., 1999)

Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion. - Edward A. Bender; L. Bruce Richmond (Electron. J. Comb., 1999)

An Approximate Probabilistic Model for Structured Gaussian Elimination. - Edward A. Bender; E. Rodney Canfield (J. Algorithms, 1999)

0-1 laws for maps. - Edward A. Bender; Kevin J. Compton; L. Bruce Richmond (Random Struct. Algorithms, 1999)

Sequences. - Thomas A. Dowling; Ralph Peter Grimaldi; Jay Yellen; Victor S. Miller; Edward A. Bender (Handbook of Discrete and Combinatorial Mathematics, 1999)

Counting Methods. - Jay Yellen; Edward W. Packel; Robert G. Rieper; George E. Andrews; Alan C. Tucker; Edward A. Bender; Bruce E. Sagan (Handbook of Discrete and Combinatorial Mathematics, 1999)

Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. - Jason P. Bell; Edward A. Bender; Peter J. Cameron; L. Bruce Richmond (Electron. J. Comb., 2000)

The Number of Labeled 2-Connected Planar Graphs. - Edward A. Bender; Zhicheng Gao; Nicholas C. Wormald (Electron. J. Comb., 2002)

A Discontinuity in the Distribution of Fixed Point Sums. - Edward A. Bender; E. Rodney Canfield; L. Bruce Richmond; Herbert S. Wilf (Electron. J. Comb., 2003)

Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls. - Edward A. Bender; J. William Helton; L. Bruce Richmond (Electron. J. Comb., 2003)

Asymptotics of combinatorial structures with large smallest component. - Edward A. Bender; Atefeh Mashatan; Daniel Panario; L. Bruce Richmond (J. Comb. Theory A, 2004)

Locally Restricted Compositions I. Restricted Adjacent Differences. - Edward A. Bender; E. Rodney Canfield (Electron. J. Comb., 2005)

Coefficients of Functional Compositions Often Grow Smoothly. - Edward A. Bender; E. Rodney Canfield; L. Bruce Richmond (Electron. J. Comb., 2008)

The Map Asymptotics Constant tg. - Edward A. Bender; Zhicheng Gao; L. Bruce Richmond (Electron. J. Comb., 2008)

Locally Restricted Compositions II. General Restrictions and Infinite Matrices. - Edward A. Bender; E. Rodney Canfield (Electron. J. Comb., 2009)

Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities. - Edward A. Bender; E. Rodney Canfield (Electron. J. Comb., 2010)

Asymptotics of Some Convolutional Recurrences. - Edward A. Bender; Adri B. Olde Daalhuis; Zhicheng Gao; L. Bruce Richmond; Nicholas C. Wormald (Electron. J. Comb., 2010)

Asymptotic Enumeration of Labelled Graphs by Genus. - Edward A. Bender; Zhicheng Gao (Electron. J. Comb., 2011)

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness. - Edward A. Bender; E. Rodney Canfield; Zhicheng Gao (Electron. J. Comb., 2012)

Part Sizes of Smooth Supercritical Compositional Structures. - Edward A. Bender; Zhicheng Gao (Comb. Probab. Comput., 2014)