E. Rodney Canfield

According to our database, E. Rodney Canfield authored at least 56 papers between 1977 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Random feedback shift registers and the limit distribution for largest cycle lengths.

Richard Arratia, E. Rodney Canfield, Alfred W. Hales

Comb. Probab. Comput., 2023

2014

The Expected Characteristic and Permanental Polynomials of the Random Gram Matrix.

Jacob G. Martin, E. Rodney Canfield

Electron. J. Comb., 2014

2012

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness.

Edward A. Bender, E. Rodney Canfield, Zhicheng Gao

Electron. J. Comb., 2012

Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124].

E. Rodney Canfield, Svante Janson, Doron Zeilberger

Adv. Appl. Math., 2012

2011

The Mahonian probability distribution on words is asymptotically normal.

E. Rodney Canfield, Svante Janson, Doron Zeilberger

Adv. Appl. Math., 2011

2010

Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities.

Edward A. Bender, E. Rodney Canfield

Electron. J. Comb., 2010

Asymptotic enumeration of integer matrices with large equal row and column sums.

E. Rodney Canfield, Brendan D. McKay

Comb., 2010

Asymptotic enumeration of correlation-immune boolean functions.

E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson

Cryptogr. Commun., 2010

2009

Ranks and Representations for Spectral Graph Bisection.

Jacob G. Martin, E. Rodney Canfield

SIAM J. Sci. Comput., 2009

Locally Restricted Compositions II. General Restrictions and Infinite Matrices.

Edward A. Bender, E. Rodney Canfield

Electron. J. Comb., 2009

2008

Counting permutations by their alternating runs.

E. Rodney Canfield, Herbert S. Wilf

J. Comb. Theory A, 2008

Asymptotic enumeration of dense 0-1 matrices with specified line sums.

E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay

J. Comb. Theory A, 2008

Coefficients of Functional Compositions Often Grow Smoothly.

Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond

Electron. J. Comb., 2008

Replication in Overlay Networks: A Multi-objective Optimization Approach.

Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. Miller, Khaled Rasheed, E. Rodney Canfield

Proceedings of the Collaborative Computing: Networking, 2008

2005

Approximate matching of XML document with regular hedge grammar.

E. Rodney Canfield, Guangming Xing

Int. J. Comput. Math., 2005

Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums.

E. Rodney Canfield, Brendan D. McKay

Electron. J. Comb., 2005

Locally Restricted Compositions I. Restricted Adjacent Differences.

Edward A. Bender, E. Rodney Canfield

Electron. J. Comb., 2005

From recursions to asymptotics: Durfee and dilogarithmic deductions.

E. Rodney Canfield

Adv. Appl. Math., 2005

Approximate XML document matching.

E. Rodney Canfield, Guangming Xing

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

2003

Integer partitions and the Sperner property.

E. Rodney Canfield

Theor. Comput. Sci., 2003

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

2002

Random Partitions with Non Negative r^th Differences.

E. Rodney Canfield, Sylvie Corteel, Pawel Hitczenko

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001

Meet and Join within the Lattice of Set Partitions.

E. Rodney Canfield

Electron. J. Comb., 2001

2000

Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater.

Neil J. Calkin, E. Rodney Canfield, Herbert S. Wilf

J. Comb. Theory A, 2000

1999

An Approximate Probabilistic Model for Structured Gaussian Elimination.

Edward A. Bender, E. Rodney Canfield

J. Algorithms, 1999

An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer.

E. Rodney Canfield, Konrad Engel

Discret. Appl. Math., 1999

Intersections of Randomly Embedded Sparse Graphs are Poisson.

Edward A. Bender, E. Rodney Canfield

Electron. J. Comb., 1999

1998

The Size of the Largest Antichain in the Partition Lattice.

E. Rodney Canfield

J. Comb. Theory A, 1998

Durfee Polynomials.

E. Rodney Canfield, Sylvie Corteel, Carla D. Savage

Electron. J. Comb., 1998

1997

The End of Pumping?

Guo-Qiang Zhang, E. Rodney Canfield

Theor. Comput. Sci., 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

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

From recursions to asymptotics: on Szekeres' formula for the number of partitions.

E. Rodney Canfield

Electron. J. Comb., 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

1996

Log-Concavity and Related Properties of the Cycle Index Polynomials.

Edward A. Bender, E. Rodney Canfield

J. Comb. Theory A, 1996

1995

Large Antichains in the Partition Lattice.

E. Rodney Canfield, L. H. Harper

Random Struct. Algorithms, 1995

Engel's Inequality for Bell Numbers.

E. Rodney Canfield

J. Comb. Theory A, 1995

1994

The Number of Degree-Restricted Rooted Maps on the Sphere.

Edward A. Bender, E. Rodney Canfield

SIAM J. Discret. Math., 1994

1993

Matchings in the Partition Lattice.

E. Rodney Canfield

SIAM J. Discret. Math., 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

1992

Asymptotic Properties of Labeled Connected Graphs.

Edward A. Bender, E. Rodney Canfield, Brendan D. McKay

Random Struct. Algorithms, 1992

A D-finiteness result for products of permutations.

E. Rodney Canfield, David M. Jackson

Discret. Math., 1992

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

1991

Combinatorial Search (Martin Aigner).

E. Rodney Canfield

SIAM Rev., 1991

The number of rooted maps on an orientable surface.

Edward A. Bender, E. Rodney Canfield

J. Comb. Theory B, 1991

Enumeration of Degree Restricted Rooted Maps on the Sphere.

Edward A. Bender, E. Rodney Canfield

Proceedings of the Planar Graphs, 1991

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

1989

Face sizes of 3-polytopes.

Edward A. Bender, E. Rodney Canfield

J. Comb. Theory B, 1989

1988

The asymptotic number of tree-rooted maps on a surface.

Edward A. Bender, E. Rodney Canfield, Robert W. Robinson

J. Comb. Theory A, 1988

1987

Ménage numbers, bijections and P-recursiveness.

E. Rodney Canfield, Nicholas C. Wormald

Discret. Math., 1987

1986

The asymptotic number of rooted maps on a surface.

Edward A. Bender, E. Rodney Canfield

J. Comb. Theory A, 1986

1984

Remarks on an Asymptotic Method in Combinatorics.

E. Rodney Canfield

J. Comb. Theory A, 1984

1983

Enumeration of connected invariant graphs.

Edward A. Bender, E. Rodney Canfield

J. Comb. Theory B, 1983

1980

Application of the Berry-Esséen Inequality to Combinatorial Estimates.

E. Rodney Canfield

J. Comb. Theory A, 1980

1978

The Asymptotic Number of Labeled Graphs with Given Degree Sequences.

Edward A. Bender, E. Rodney Canfield

J. Comb. Theory A, 1978

1977

Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial Type.

E. Rodney Canfield

J. Comb. Theory A, 1977