| 2008 |
|---|
| 40 | EE | E. Rodney Canfield,
Catherine S. Greenhill,
Brendan D. McKay:
Asymptotic enumeration of dense 0-1 matrices with specified line sums.
J. Comb. Theory, Ser. A 115(1): 32-66 (2008) |
| 39 | EE | E. Rodney Canfield,
Herbert S. Wilf:
Counting permutations by their alternating runs.
J. Comb. Theory, Ser. A 115(2): 213-225 (2008) |
| 2005 |
|---|
| 38 | EE | E. Rodney Canfield,
Guangming Xing:
Approximate XML document matching.
SAC 2005: 787-788 |
| 37 | EE | E. Rodney Canfield,
Brendan D. McKay:
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums.
Electr. J. Comb. 12: (2005) |
| 36 | EE | Edward A. Bender,
E. Rodney Canfield:
Locally Restricted Compositions I. Restricted Adjacent Differences.
Electr. J. Comb. 12: (2005) |
| 35 | EE | E. Rodney Canfield,
Guangming Xing:
Approximate matching of XML document with regular hedge grammar.
Int. J. Comput. Math. 82(10): 1191-1198 (2005) |
| 2003 |
|---|
| 34 | 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) |
| 33 | EE | E. Rodney Canfield:
Integer partitions and the Sperner property.
Theor. Comput. Sci. 307(3): 515-529 (2003) |
| 2002 |
|---|
| 32 | EE | E. Rodney Canfield,
Sylvie Corteel,
Pawel Hitczenko:
Random Partitions with Non Negative rth Differences.
LATIN 2002: 131-140 |
| 2001 |
|---|
| 31 | EE | E. Rodney Canfield:
Meet and Join within the Lattice of Set Partitions.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 30 | EE | Neil J. Calkin,
E. Rodney Canfield,
Herbert S. Wilf:
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater.
J. Comb. Theory, Ser. A 91(1-2): 171-190 (2000) |
| 1999 |
|---|
| 29 | EE | E. Rodney Canfield,
Konrad Engel:
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer.
Discrete Applied Mathematics 95(1-3): 169-180 (1999) |
| 28 | EE | Edward A. Bender,
E. Rodney Canfield:
Intersections of Randomly Embedded Sparse Graphs are Poisson.
Electr. J. Comb. 6: (1999) |
| 27 | | Edward A. Bender,
E. Rodney Canfield:
An Approximate Probabilistic Model for Structured Gaussian Elimination.
J. Algorithms 31(2): 271-290 (1999) |
| 1998 |
|---|
| 26 | EE | E. Rodney Canfield,
Sylvie Corteel,
Carla D. Savage:
Durfee Polynomials.
Electr. J. Comb. 5: (1998) |
| 25 | EE | E. Rodney Canfield:
The Size of the Largest Antichain in the Partition Lattice.
J. Comb. Theory, Ser. A 83(2): 188-201 (1998) |
| 1997 |
|---|
| 24 | | 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) |
| 23 | 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) |
| 22 | EE | E. Rodney Canfield:
From recursions to asymptotics: on Szekeres' formula for the number of partitions.
Electr. J. Comb. 4(2): (1997) |
| 21 | 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) |
| 20 | EE | Guo-Qiang Zhang,
E. Rodney Canfield:
The End of Pumping?
Theor. Comput. Sci. 174(1-2): 275-279 (1997) |
| 1996 |
|---|
| 19 | 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 |
|---|
| 18 | | E. Rodney Canfield:
Engel's Inequality for Bell Numbers.
J. Comb. Theory, Ser. A 72(1): 184-187 (1995) |
| 17 | | E. Rodney Canfield,
L. H. Harper:
Large Antichains in the Partition Lattice.
Random Struct. Algorithms 6(1): 89-104 (1995) |
| 1994 |
|---|
| 16 | 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 |
|---|
| 15 | | 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) |
| 14 | | E. Rodney Canfield:
Matchings in the Partition Lattice.
SIAM J. Discrete Math. 6(1): 100-109 (1993) |
| 1992 |
|---|
| 13 | EE | E. Rodney Canfield,
D. M. Jackson:
A D-finiteness result for products of permutations.
Discrete Mathematics 99(1-3): 25-30 (1992) |
| 12 | | Edward A. Bender,
E. Rodney Canfield,
Brendan D. McKay:
Asymptotic Properties of Labeled Connected Graphs.
Random Struct. Algorithms 3(2): 183-202 (1992) |
| 1991 |
|---|
| 11 | 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 |
|---|
| 10 | | 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 |
|---|
| 9 | EE | Edward A. Bender,
E. Rodney Canfield:
Face sizes of 3-polytopes.
J. Comb. Theory, Ser. B 46(1): 58-65 (1989) |
| 1988 |
|---|
| 8 | 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) |
| 1987 |
|---|
| 7 | EE | E. Rodney Canfield,
Nicholas C. Wormald:
Ménage numbers, bijections and P-recursiveness.
Discrete Mathematics 63(2-3): 117-129 (1987) |
| 1986 |
|---|
| 6 | 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) |
| 1984 |
|---|
| 5 | | E. Rodney Canfield:
Remarks on an Asymptotic Method in Combinatorics.
J. Comb. Theory, Ser. A 37(3): 348-352 (1984) |
| 1983 |
|---|
| 4 | EE | Edward A. Bender,
E. Rodney Canfield:
Enumeration of connected invariant graphs.
J. Comb. Theory, Ser. B 34(3): 268-278 (1983) |
| 1980 |
|---|
| 3 | | E. Rodney Canfield:
Application of the Berry-Esséen Inequality to Combinatorial Estimates.
J. Comb. Theory, Ser. A 28(1): 17-25 (1980) |
| 1978 |
|---|
| 2 | | 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) |
| 1977 |
|---|
| 1 | | E. Rodney Canfield:
Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial Type.
J. Comb. Theory, Ser. A 23(3): 275-290 (1977) |
