Search results for "E. Rodney Canfield"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Edward A. Bender, E. Rodney Canfield	Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson	Asymptotic enumeration of correlation-immune boolean functions.	Cryptography and Communications	2010	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, Brendan D. McKay	Asymptotic enumeration of integer matrices with large equal row and column sums.	Combinatorica	2010	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson	Asymptotic enumeration of correlation-immune boolean functions.	IACR Cryptology ePrint Archive	2009	DBLP BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	Locally Restricted Compositions II. General Restrictions and Infinite Matrices.	Electr. J. Comb.	2009	DBLP BibTeX RDF
1	Jacob G. Martin, E. Rodney Canfield	Ranks and Representations for Spectral Graph Bisection.	SIAM J. Scientific Computing	2009	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, Herbert S. Wilf	Counting permutations by their alternating runs.	J. Comb. Theory, Ser. A	2008	DBLP DOI BibTeX RDF
1	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	2008	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond	Coefficients of Functional Compositions Often Grow Smoothly.	Electr. J. Comb.	2008	DBLP BibTeX RDF
1	Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. Miller, Khaled Rasheed, E. Rodney Canfield	Replication in Overlay Networks: A Multi-objective Optimization Approach.	CollaborateCom	2008	DBLP DOI BibTeX RDF	Greedy Approach, Evolutionary Algorithms, Replication, Multi-Objective Optimization
1	E. Rodney Canfield, Brendan D. McKay	Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums.	Electr. J. Comb.	2005	DBLP BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	Locally Restricted Compositions I. Restricted Adjacent Differences.	Electr. J. Comb.	2005	DBLP BibTeX RDF
1	E. Rodney Canfield, Guangming Xing	Approximate matching of XML document with regular hedge grammar.	Int. J. Comput. Math.	2005	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, Guangming Xing	Approximate XML document matching.	SAC	2005	DBLP DOI BibTeX RDF	tree grammar, XML, tree, approximate matching, document transformation, design of algorithm
1	E. Rodney Canfield	Integer partitions and the Sperner property.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf	A Discontinuity in the Distribution of Fixed Point Sums.	Electr. J. Comb.	2003	DBLP BibTeX RDF
1	E. Rodney Canfield, Sylvie Corteel, Pawel Hitczenko	Random Partitions with Non Negative rth Differences.	LATIN	2002	DBLP DOI BibTeX RDF
1	E. Rodney Canfield	Meet and Join within the Lattice of Set Partitions.	Electr. J. Comb.	2001	DBLP BibTeX RDF
1	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	2000	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	Intersections of Randomly Embedded Sparse Graphs are Poisson.	Electr. J. Comb.	1999	DBLP BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	An Approximate Probabilistic Model for Structured Gaussian Elimination.	J. Algorithms	1999	DBLP DOI BibTeX RDF
1	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	1999	DBLP DOI BibTeX RDF
1	E. Rodney Canfield	The Size of the Largest Antichain in the Partition Lattice.	J. Comb. Theory, Ser. A	1998	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, Sylvie Corteel, Carla D. Savage	Durfee Polynomials.	Electr. J. Comb.	1998	DBLP BibTeX RDF
1	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	1997	DBLP DOI BibTeX RDF
1	Guo-Qiang Zhang, E. Rodney Canfield	The End of Pumping?	Theor. Comput. Sci.	1997	DBLP DOI BibTeX RDF
1	E. Rodney Canfield	From recursions to asymptotics: on Szekeres' formula for the number of partitions.	Electr. J. Comb.	1997	DBLP BibTeX RDF
1	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.	1997	DBLP BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Richmond	Submap Density and Asymmetry Results for Two Parameter Map Families.	Combinatorics, Probability & Computing	1997	DBLP BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	Log-Concavity and Related Properties of the Cycle Index Polynomials.	J. Comb. Theory, Ser. A	1996	DBLP DOI BibTeX RDF
1	E. Rodney Canfield	Engel's Inequality for Bell Numbers.	J. Comb. Theory, Ser. A	1995	DBLP BibTeX RDF
1	E. Rodney Canfield, L. H. Harper	Large Antichains in the Partition Lattice.	Random Struct. Algorithms	1995	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	The Number of Degree-Restricted Rooted Maps on the Sphere.	SIAM J. Discrete Math.	1994	DBLP DOI BibTeX RDF
1	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	1993	DBLP BibTeX RDF
1	E. Rodney Canfield	Matchings in the Partition Lattice.	SIAM J. Discrete Math.	1993	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, D. M. Jackson	A D-finiteness result for products of permutations.	Discrete Mathematics	1992	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield, Brendan D. McKay	Asymptotic Properties of Labeled Connected Graphs.	Random Struct. Algorithms	1992	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	The number of rooted maps on an orientable surface.	J. Comb. Theory, Ser. B	1991	DBLP DOI BibTeX RDF
1	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	1990	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	Face sizes of 3-polytopes.	J. Comb. Theory, Ser. B	1989	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield, Robert W. Robinson	The asymptotic number of tree-rooted maps on a surface.	J. Comb. Theory, Ser. A	1988	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, Nicholas C. Wormald	Ménage numbers, bijections and P-recursiveness.	Discrete Mathematics	1987	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	The asymptotic number of rooted maps on a surface.	J. Comb. Theory, Ser. A	1986	DBLP DOI BibTeX RDF
1	E. Rodney Canfield	Remarks on an Asymptotic Method in Combinatorics.	J. Comb. Theory, Ser. A	1984	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	Enumeration of connected invariant graphs.	J. Comb. Theory, Ser. B	1983	DBLP DOI BibTeX RDF
1	E. Rodney Canfield	Application of the Berry-Esséen Inequality to Combinatorial Estimates.	J. Comb. Theory, Ser. A	1980	DBLP DOI BibTeX RDF
1	Edward A. Bender, E. Rodney Canfield	The Asymptotic Number of Labeled Graphs with Given Degree Sequences.	J. Comb. Theory, Ser. A	1978	DBLP DOI BibTeX RDF
1	E. Rodney Canfield	Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial Type.	J. Comb. Theory, Ser. A	1977	DBLP DOI BibTeX RDF

Publications of "E. Rodney Canfield" ( http://dblp.L3S.de/Authors/E._Rodney_Canfield )