| 2005 |
| 55 | EE | Edward A. Bender,
E. Rodney Canfield:
Locally Restricted Compositions I. Restricted Adjacent Differences.
Electr. J. Comb. 12: (2005) |
| 2004 |
| 54 | EE | Edward A. Bender,
Atefeh Mashatan,
Daniel Panario,
L. Bruce Richmond:
Asymptotics of combinatorial structures with large smallest component.
J. Comb. Theory, Ser. A 107(1): 117-125 (2004) |
| 2003 |
| 53 | EE | Edward A. Bender,
E. Rodney Canfield,
L. Bruce Richmond,
Herbert S. Wilf:
A Discontinuity in the Distribution of Fixed Point Sums.
Electr. J. Comb. 10: (2003) |
| 52 | EE | Edward A. Bender,
William J. Helton,
L. Bruce Richmond:
Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls.
Electr. J. Comb. 10: (2003) |
| 2002 |
| 51 | EE | Edward A. Bender,
Zhicheng Gao,
Nicholas C. Wormald:
The Number of Labeled 2-Connected Planar Graphs.
Electr. J. Comb. 9(1): (2002) |
| 2000 |
| 50 | EE | Jason P. Bell,
Edward A. Bender,
Peter J. Cameron,
L. Bruce Richmond:
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components.
Electr. J. Comb. 7: (2000) |
| 1999 |
| 49 | EE | Edward A. Bender,
E. Rodney Canfield:
Intersections of Randomly Embedded Sparse Graphs are Poisson.
Electr. J. Comb. 6: (1999) |
| 48 | EE | Edward A. Bender,
L. Bruce Richmond:
Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion.
Electr. J. Comb. 6: (1999) |
| 47 | | Edward A. Bender,
E. Rodney Canfield:
An Approximate Probabilistic Model for Structured Gaussian Elimination.
J. Algorithms 31(2): 271-290 (1999) |
| 46 | | Edward A. Bender,
Kevin J. Compton,
L. Bruce Richmond:
0-1 laws for maps.
Random Struct. Algorithms 14(3): 215-237 (1999) |
| 1998 |
| 45 | EE | Edward A. Bender,
L. Bruce Richmond:
A Multivariate Lagrange Inversion Formula for Asymptotic Calculations.
Electr. J. Comb. 5: (1998) |
| 44 | EE | Edward A. Bender,
S. Gill Williamson:
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks.
Electr. J. Comb. 5: (1998) |
| 1997 |
| 43 | | Edward A. Bender,
E. Rodney Canfield,
Zhicheng Gao,
L. Bruce Richmond:
Submap Density and Asymmetry Results for Two Parameter Map Families.
Combinatorics, Probability & Computing 6(1): 17-25 (1997) |
| 42 | EE | Edward A. Bender,
E. Rodney Canfield:
The Fraction of Subspaces of GF(q) n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson.
Electr. J. Comb. 4(1): (1997) |
| 41 | EE | Edward A. Bender,
E. Rodney Canfield,
Brendan D. McKay:
The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices.
J. Comb. Theory, Ser. A 80(1): 124-150 (1997) |
| 1996 |
| 40 | EE | Edward A. Bender,
L. Bruce Richmond:
Admissible Functions and Asymptotics for Labelled Structures by Number of Components.
Electr. J. Comb. 3(1): (1996) |
| 39 | EE | Edward A. Bender,
E. Rodney Canfield:
Log-Concavity and Related Properties of the Cycle Index Polynomials.
J. Comb. Theory, Ser. A 74(1): 57-70 (1996) |
| 1995 |
| 38 | | Edward A. Bender,
L. Bruce Richmond,
Nicholas C. Wormald:
Largest 4-Connected Components of 3-Connected Planar Triangulations.
Random Struct. Algorithms 7(4): 273-286 (1995) |
| 1994 |
| 37 | EE | Edward A. Bender,
E. Rodney Canfield:
The Number of Degree-Restricted Rooted Maps on the Sphere.
SIAM J. Discrete Math. 7(1): 9-15 (1994) |
| 1993 |
| 36 | EE | Edward A. Bender,
Fred Kochman:
The Distribution of Subword Counts is Usually Normal.
Eur. J. Comb. 14(4): 265-275 (1993) |
| 35 | | Edward A. Bender,
E. Rodney Canfield,
L. Bruce Richmond:
The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces.
J. Comb. Theory, Ser. A 63(2): 318-329 (1993) |
| 1992 |
| 34 | | Edward A. Bender,
Raymond Coley,
David P. Robbins,
Howard Rumsey Jr.:
Enumeration of Subspaces by Dimension Sequence.
J. Comb. Theory, Ser. A 59(1): 1-11 (1992) |
| 33 | EE | Edward A. Bender,
Zhicheng Gao,
L. Bruce Richmond:
Submaps of maps. I. General 0-1 laws.
J. Comb. Theory, Ser. B 55(1): 104-117 (1992) |
| 32 | EE | Edward A. Bender,
Zhicheng Gao,
William McCuaig,
L. Bruce Richmond:
Submaps of maps. II. Cyclically k-connected planar cubic maps.
J. Comb. Theory, Ser. B 55(1): 118-124 (1992) |
| 31 | EE | Edward A. Bender,
L. Bruce Richmond:
Submaps of maps. III. k-Connected nonplanar maps.
J. Comb. Theory, Ser. B 55(1): 125-132 (1992) |
| 30 | | Edward A. Bender,
E. Rodney Canfield,
Brendan D. McKay:
Asymptotic Properties of Labeled Connected Graphs.
Random Struct. Algorithms 3(2): 183-202 (1992) |
| 1991 |
| 29 | EE | Edward A. Bender,
E. Rodney Canfield:
The number of rooted maps on an orientable surface.
J. Comb. Theory, Ser. B 53(2): 293-299 (1991) |
| 1990 |
| 28 | | Edward A. Bender,
E. Rodney Canfield,
Brendan D. McKay:
The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges.
Random Struct. Algorithms 1(2): 127-170 (1990) |
| 1989 |
| 27 | | Edward A. Bender,
Jon T. Butler:
On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions.
IEEE Trans. Computers 38(1): 82-98 (1989) |
| 26 | EE | Edward A. Bender,
E. Rodney Canfield:
Face sizes of 3-polytopes.
J. Comb. Theory, Ser. B 46(1): 58-65 (1989) |
| 1988 |
| 25 | EE | Edward A. Bender,
E. Rodney Canfield,
Robert W. Robinson:
The asymptotic number of tree-rooted maps on a surface.
J. Comb. Theory, Ser. A 48(2): 156-164 (1988) |
| 24 | EE | Edward A. Bender,
Nicholas C. Wormald:
The asymptotic number of rooted nonseparable maps on a surface.
J. Comb. Theory, Ser. A 49(2): 370-380 (1988) |
| 23 | EE | Edward A. Bender,
Robert W. Robinson:
The asymptotic number of acyclic digraphs, II.
J. Comb. Theory, Ser. B 44(3): 363-369 (1988) |
| 1987 |
| 22 | | Edward A. Bender,
Cheryl E. Praeger,
Nicholas C. Wormald:
Optimal Worst Case Trees.
Acta Inf. 24(4): 475-489 (1987) |
| 1986 |
| 21 | | Edward A. Bender,
L. Bruce Richmond,
Robert W. Robinson,
Nicholas C. Wormald:
The asymptotic number of acyclic diagraphs I.
Combinatorica 6(1): 15-22 (1986) |
| 20 | EE | Edward A. Bender,
L. Bruce Richmond:
A generalisation of Canfield's formula.
J. Comb. Theory, Ser. A 41(1): 50-60 (1986) |
| 19 | EE | Edward A. Bender,
E. Rodney Canfield:
The asymptotic number of rooted maps on a surface.
J. Comb. Theory, Ser. A 43(2): 244-257 (1986) |
| 18 | EE | Edward A. Bender,
L. Bruce Richmond:
A survey of the asymptotic behaviour of maps.
J. Comb. Theory, Ser. B 40(3): 297-329 (1986) |
| 1985 |
| 17 | EE | Edward A. Bender,
Nicholas C. Wormald:
The number of loopless planar maps.
Discrete Mathematics 54(2): 235-237 (1985) |
| 16 | EE | Edward A. Bender,
Jon T. Butler:
Enumeration of Structured Flowcharts
J. ACM 32(3): 537-548 (1985) |
| 15 | | Edward A. Bender,
Herbert S. Wilf:
A Theoretical Analysis of Backtracking in the Graph Coloring Problem.
J. Algorithms 6(2): 275-282 (1985) |
| 14 | | Edward A. Bender:
Some Asymptotic Bijections.
J. Comb. Theory, Ser. A 38(1): 96-98 (1985) |
| 1984 |
| 13 | EE | Edward A. Bender,
John S. Devitt,
L. Bruce Richmond:
Partitions of multisets II.
Discrete Mathematics 50: 1-8 (1984) |
| 12 | EE | Edward A. Bender,
L. Bruce Richmond:
An asymptotic expansion for the coefficients of some power series II: Lagrange inversion.
Discrete Mathematics 50: 135-141 (1984) |
| 11 | EE | Edward A. Bender,
L. Bruce Richmond:
The asymptotic enumeration of rooted convex polyhedra.
J. Comb. Theory, Ser. B 36(3): 276-283 (1984) |
| 1983 |
| 10 | | Edward A. Bender,
L. Bruce Richmond:
Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions.
J. Comb. Theory, Ser. A 34(3): 255-265 (1983) |
| 9 | | Edward A. Bender,
L. Bruce Richmond,
S. G. Williamson:
Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions.
J. Comb. Theory, Ser. A 35(3): 263-278 (1983) |
| 8 | EE | Edward A. Bender,
E. Rodney Canfield:
Enumeration of connected invariant graphs.
J. Comb. Theory, Ser. B 34(3): 268-278 (1983) |
| 1980 |
| 7 | EE | Edward A. Bender:
The Number of Fanout-Free Functions with Various Gates.
J. ACM 27(1): 181-190 (1980) |
| 1979 |
| 6 | | Edward A. Bender:
Surveyor's Forum: A Recurrent Problem.
ACM Comput. Surv. 11(1): 67-68 (1979) |
| 1978 |
| 5 | | Edward A. Bender,
Jon T. Butler:
Asymptotic Aproximations for the Number of Fanout-Free Functions.
IEEE Trans. Computers 27(12): 1180-1183 (1978) |
| 4 | | Edward A. Bender,
E. Rodney Canfield:
The Asymptotic Number of Labeled Graphs with Given Degree Sequences.
J. Comb. Theory, Ser. A 24(3): 296-307 (1978) |
| 1974 |
| 3 | | Edward A. Bender:
On Buckhiester's Enumeration of n x n Matrices.
J. Comb. Theory, Ser. A 17(2): 273-274 (1974) |
| 1973 |
| 2 | | Edward A. Bender:
Central and Local Limit Theorems Applied to Asymptotic Enumeration.
J. Comb. Theory, Ser. A 15(1): 91-111 (1973) |
| 1972 |
| 1 | | Edward A. Bender,
Donald E. Knuth:
Enumeration of Plane Partitions.
J. Comb. Theory, Ser. A 13(1): 40-54 (1972) |