E. Rodney Canfield - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

2014

The Expected Characteristic and Permanental Polynomials of the Random Gram MatrixJacob G. Martin, E. Rodney Canfield. combinatorics, 21(3):3, 2014. [doi]

2012

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-FreenessEdward A. Bender, E. Rodney Canfield, Zhicheng Gao. combinatorics, 19(4):14, 2012. [doi]

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. aam, 49(1):77, 2012. [doi]

2011

The Mahonian probability distribution on words is asymptotically normalE. Rodney Canfield, Svante Janson, Doron Zeilberger. aam, 46(1-4):109-124, 2011. [doi]

2010

Locally Restricted Compositions III. Adjacent-Part Periodic InequalitiesEdward A. Bender, E. Rodney Canfield. combinatorics, 17(1), 2010. [doi]

Asymptotic enumeration of integer matrices with large equal row and column sumsE. Rodney Canfield, Brendan D. McKay. combinatorica, 30(6):655-680, 2010. [doi]

Asymptotic enumeration of correlation-immune boolean functionsE. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson. ccds, 2(1):111-126, 2010. [doi]

2009

Locally Restricted Compositions II. General Restrictions and Infinite MatricesEdward A. Bender, E. Rodney Canfield. combinatorics, 16(1), 2009. [doi]

Asymptotic enumeration of correlation-immune boolean functionsE. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson. iacr, 2009:460, 2009. [doi]

Ranks and Representations for Spectral Graph BisectionJacob G. Martin, E. Rodney Canfield. siamsc, 31(5):3529-3546, 2009. [doi]

2008

2005

2003

A Discontinuity in the Distribution of Fixed Point SumsEdward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf. combinatorics, 10, 2003. [doi]

Integer partitions and the Sperner propertyE. Rodney Canfield. TCS, 307(3):515-529, 2003. [doi]

2002

Random Partitions with Non Negative r:::th::: DifferencesE. Rodney Canfield, Sylvie Corteel, Pawel Hitczenko. latin 2002: 131-140 [doi]

2001

Meet and Join within the Lattice of Set PartitionsE. Rodney Canfield. combinatorics, 8(1), 2001. [doi]

2000

Averaging Sequences, Deranged Mappings, and a Problem of Lampert and SlaterNeil J. Calkin, E. Rodney Canfield, Herbert S. Wilf. JCT, 91(1-2):171-190, 2000. [doi]

1999

Intersections of Randomly Embedded Sparse Graphs are PoissonEdward A. Bender, E. Rodney Canfield. combinatorics, 6, 1999. [doi]

An Approximate Probabilistic Model for Structured Gaussian EliminationEdward A. Bender, E. Rodney Canfield. jal, 31(2):271-290, 1999.

An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an IntegerE. Rodney Canfield, Konrad Engel. DAM, 95(1-3):169-180, 1999. [doi]

1998

Durfee PolynomialsE. Rodney Canfield, Sylvie Corteel, Carla D. Savage. combinatorics, 5, 1998. [doi]

The Size of the Largest Antichain in the Partition LatticeE. Rodney Canfield. JCT, 83(2):188-201, 1998. [doi]

1997

1996

Log-Concavity and Related Properties of the Cycle Index PolynomialsEdward A. Bender, E. Rodney Canfield. JCT, 74(1):57-70, 1996. [doi]

1995

Large Antichains in the Partition LatticeE. Rodney Canfield, L. H. Harper. rsa, 6(1):89-104, 1995.

Engel s Inequality for Bell NumbersE. Rodney Canfield. JCT, 72(1):184-187, 1995.

1994

The Number of Degree-Restricted Rooted Maps on the SphereEdward A. Bender, E. Rodney Canfield. siamdm, 7(1):9-15, 1994. [doi]

1993

The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and FacesEdward A. Bender, E. Rodney Canfield, L. Bruce Richmond. JCT, 63(2):318-329, 1993.

Matchings in the Partition LatticeE. Rodney Canfield. siamdm, 6(1):100-109, 1993.

1992

Asymptotic Properties of Labeled Connected GraphsEdward A. Bender, E. Rodney Canfield, Brendan D. McKay. rsa, 3(2):183-202, 1992.

The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edgesEdward A. Bender, E. Rodney Canfield, Brendan D. McKay. ajc, 6:119-124, 1992. [doi]

A D-finiteness result for products of permutationsE. Rodney Canfield, D. M. Jackson. DM, 99(1-3):25-30, 1992. [doi]

1991

The number of rooted maps on an orientable surfaceEdward A. Bender, E. Rodney Canfield. JCT, 53(2):293-299, 1991. [doi]

Enumeration of Degree Restricted Rooted Maps on the SphereEdward A. Bender, E. Rodney Canfield. dimacs 1993: 13-16

Combinatorial Search (Martin Aigner)E. Rodney Canfield. siamrev, 33(1):132-133, 1991. [doi]

1990

The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and EdgesEdward A. Bender, E. Rodney Canfield, Brendan D. McKay. rsa, 1(2):127-170, 1990.

1989

Face sizes of 3-polytopesEdward A. Bender, E. Rodney Canfield. JCT, 46(1):58-65, 1989. [doi]

1988

The asymptotic number of tree-rooted maps on a surfaceEdward A. Bender, E. Rodney Canfield, Robert W. Robinson. JCT, 48(2):156-164, 1988. [doi]

1987

Ménage numbers, bijections and P-recursivenessE. Rodney Canfield, Nicholas C. Wormald. DM, 63(2-3):117-129, 1987. [doi]

1986

The asymptotic number of rooted maps on a surfaceEdward A. Bender, E. Rodney Canfield. JCT, 43(2):244-257, 1986. [doi]

1984

Remarks on an Asymptotic Method in CombinatoricsE. Rodney Canfield. JCT, 37(3):348-352, 1984.

1983

Enumeration of connected invariant graphsEdward A. Bender, E. Rodney Canfield. JCT, 34(3):268-278, 1983. [doi]

1980

Application of the Berry-Esséen Inequality to Combinatorial EstimatesE. Rodney Canfield. JCT, 28(1):17-25, 1980.

1978

The Asymptotic Number of Labeled Graphs with Given Degree SequencesEdward A. Bender, E. Rodney Canfield. JCT, 24(3):296-307, 1978.

1977

Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial TypeE. Rodney Canfield. JCT, 23(3):275-290, 1977.

Sign in or sign up to see more results.

runs on WebDSL