Search the dblp DataBase
E. Rodney Canfield :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
E. Rodney Canfield , Sylvie Corteel , Pawel Hitczenko Random Partitions with Non Negative rth Differences. [Citation Graph (0, 0)][DBLP ] LATIN, 2002, pp:131-140 [Conf ] E. Rodney Canfield , Guangming Xing Approximate XML document matching. [Citation Graph (0, 0)][DBLP ] SAC, 2005, pp:787-788 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal ] Edward A. Bender , E. Rodney Canfield Intersections of Randomly Embedded Sparse Graphs are Poisson. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1999, v:6, n:, pp:- [Journal ] Edward A. Bender , E. Rodney Canfield , L. Bruce Richmond , Herbert S. Wilf A Discontinuity in the Distribution of Fixed Point Sums. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal ] E. Rodney Canfield Meet and Join within the Lattice of Set Partitions. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal ] E. Rodney Canfield From recursions to asymptotics: on Szekeres' formula for the number of partitions. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal ] E. Rodney Canfield , Sylvie Corteel , Carla D. Savage Durfee Polynomials. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1998, v:5, n:, pp:- [Journal ] Edward A. Bender , E. Rodney Canfield , Zhicheng Gao , L. Bruce Richmond Submap Density and Asymmetry Results for Two Parameter Map Families. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:17-25 [Journal ] E. Rodney Canfield , Konrad Engel An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:169-180 [Journal ] E. Rodney Canfield , Guangming Xing Approximate matching of XML document with regular hedge grammar. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Math., 2005, v:82, n:10, pp:1191-1198 [Journal ] Edward A. Bender , E. Rodney Canfield An Approximate Probabilistic Model for Structured Gaussian Elimination. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1999, v:31, n:2, pp:271-290 [Journal ] Edward A. Bender , E. Rodney Canfield The Asymptotic Number of Labeled Graphs with Given Degree Sequences. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1978, v:24, n:3, pp:296-307 [Journal ] Edward A. Bender , E. Rodney Canfield Enumeration of connected invariant graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:268-278 [Journal ] Edward A. Bender , E. Rodney Canfield The asymptotic number of rooted maps on a surface. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:244-257 [Journal ] Edward A. Bender , E. Rodney Canfield Face sizes of 3-polytopes. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1989, v:46, n:1, pp:58-65 [Journal ] Edward A. Bender , E. Rodney Canfield The number of rooted maps on an orientable surface. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:53, n:2, pp:293-299 [Journal ] Edward A. Bender , E. Rodney Canfield Log-Concavity and Related Properties of the Cycle Index Polynomials. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:57-70 [Journal ] Edward A. Bender , E. Rodney Canfield , Brendan D. McKay The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:80, n:1, pp:124-150 [Journal ] Edward A. Bender , E. Rodney Canfield , Robert W. Robinson The asymptotic number of tree-rooted maps on a surface. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1988, v:48, n:2, pp:156-164 [Journal ] Edward A. Bender , E. Rodney Canfield , L. Bruce Richmond The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1993, v:63, n:2, pp:318-329 [Journal ] Neil J. Calkin , E. Rodney Canfield , Herbert S. Wilf Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:171-190 [Journal ] E. Rodney Canfield Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial Type. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1977, v:23, n:3, pp:275-290 [Journal ] E. Rodney Canfield Application of the Berry-Esséen Inequality to Combinatorial Estimates. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1980, v:28, n:1, pp:17-25 [Journal ] E. Rodney Canfield Remarks on an Asymptotic Method in Combinatorics. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:348-352 [Journal ] E. Rodney Canfield Engel's Inequality for Bell Numbers. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1995, v:72, n:1, pp:184-187 [Journal ] E. Rodney Canfield The Size of the Largest Antichain in the Partition Lattice. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1998, v:83, n:2, pp:188-201 [Journal ] Edward A. Bender , E. Rodney Canfield , Brendan D. McKay The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1990, v:1, n:2, pp:127-170 [Journal ] Edward A. Bender , E. Rodney Canfield , Brendan D. McKay Asymptotic Properties of Labeled Connected Graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1992, v:3, n:2, pp:183-202 [Journal ] E. Rodney Canfield , L. H. Harper Large Antichains in the Partition Lattice. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1995, v:6, n:1, pp:89-104 [Journal ] Edward A. Bender , E. Rodney Canfield The Number of Degree-Restricted Rooted Maps on the Sphere. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1994, v:7, n:1, pp:9-15 [Journal ] E. Rodney Canfield Matchings in the Partition Lattice. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1993, v:6, n:1, pp:100-109 [Journal ] E. Rodney Canfield Integer partitions and the Sperner property. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:307, n:3, pp:515-529 [Journal ] Guo-Qiang Zhang , E. Rodney Canfield The End of Pumping? [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:174, n:1-2, pp:275-279 [Journal ] E. Rodney Canfield , Nicholas C. Wormald Ménage numbers, bijections and P-recursiveness. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1987, v:63, n:2-3, pp:117-129 [Journal ] E. Rodney Canfield , D. M. Jackson A D-finiteness result for products of permutations. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:99, n:1-3, pp:25-30 [Journal ] Replication in Overlay Networks: A Multi-objective Optimization Approach. [Citation Graph (, )][DBLP ] Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. [Citation Graph (, )][DBLP ] Locally Restricted Compositions I. Restricted Adjacent Differences. [Citation Graph (, )][DBLP ] Search in 0.026secs, Finished in 0.029secs