default search action
E. Rodney Canfield
Person information
- affiliation: University of Georgia, Athens, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j52]Richard Arratia, E. Rodney Canfield, Alfred W. Hales:
Random feedback shift registers and the limit distribution for largest cycle lengths. Comb. Probab. Comput. 32(4): 559-593 (2023)
2010 – 2019
- 2014
- [j51]Jacob G. Martin, E. Rodney Canfield:
The Expected Characteristic and Permanental Polynomials of the Random Gram Matrix. Electron. J. Comb. 21(3): 3 (2014) - 2012
- [j50]E. Rodney Canfield, Svante Janson, Doron Zeilberger:
Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124]. Adv. Appl. Math. 49(1): 77 (2012) - [j49]Edward A. Bender, E. Rodney Canfield, Zhicheng Gao:
Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness. Electron. J. Comb. 19(4): 14 (2012) - 2011
- [j48]E. Rodney Canfield, Svante Janson, Doron Zeilberger:
The Mahonian probability distribution on words is asymptotically normal. Adv. Appl. Math. 46(1-4): 109-124 (2011) - 2010
- [j47]E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay
, Robert W. Robinson:
Asymptotic enumeration of correlation-immune boolean functions. Cryptogr. Commun. 2(1): 111-126 (2010) - [j46]E. Rodney Canfield, Brendan D. McKay
Asymptotic enumeration of integer matrices with large equal row and column sums. Comb. 30(6): 655-680 (2010) - [j45]Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j44]Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions II. General Restrictions and Infinite Matrices. Electron. J. Comb. 16(1) (2009) - [j43]Jacob G. Martin
Ranks and Representations for Spectral Graph Bisection. SIAM J. Sci. Comput. 31(5): 3529-3546 (2009) - [i1]E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson:
Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptol. ePrint Arch. 2009: 460 (2009) - 2008
- [j42]Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond:
Coefficients of Functional Compositions Often Grow Smoothly. Electron. J. Comb. 15(1) (2008) - [j41]E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of dense 0-1 matrices with specified line sums. J. Comb. Theory A 115(1): 32-66 (2008) - [j40]E. Rodney Canfield, Herbert S. Wilf:
Counting permutations by their alternating runs. J. Comb. Theory A 115(2): 213-225 (2008) - [c4]Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. Miller
Replication in Overlay Networks: A Multi-objective Optimization Approach. CollaborateCom 2008: 512-528 - 2005
- [j39]E. Rodney Canfield:
From recursions to asymptotics: Durfee and dilogarithmic deductions. Adv. Appl. Math. 34(4): 768-797 (2005) - [j38]Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions I. Restricted Adjacent Differences. Electron. J. Comb. 12 (2005) - [j37]E. Rodney Canfield, Brendan D. McKay
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. Electron. J. Comb. 12 (2005) - [j36]E. Rodney Canfield, Guangming Xing:
Approximate matching of XML document with regular hedge grammar. Int. J. Comput. Math. 82(10): 1191-1198 (2005) - [c3]E. Rodney Canfield, Guangming Xing:
Approximate XML document matching. SAC 2005: 787-788 - 2003
- [j35]Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf:
A Discontinuity in the Distribution of Fixed Point Sums. Electron. J. Comb. 10 (2003) - [j34]E. Rodney Canfield:
Integer partitions and the Sperner property. Theor. Comput. Sci. 307(3): 515-529 (2003) - 2002
- [c2]E. Rodney Canfield, Sylvie Corteel, Pawel Hitczenko:
Random Partitions with Non Negative rth Differences. LATIN 2002: 131-140 - 2001
- [j33]E. Rodney Canfield:
Meet and Join within the Lattice of Set Partitions. Electron. J. Comb. 8(1) (2001) - 2000
- [j32]Neil J. Calkin
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater. J. Comb. Theory A 91(1-2): 171-190 (2000)
1990 – 1999
- 1999
- [j31]Edward A. Bender, E. Rodney Canfield:
Intersections of Randomly Embedded Sparse Graphs are Poisson. Electron. J. Comb. 6 (1999) - [j30]E. Rodney Canfield, Konrad Engel:
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. Discret. Appl. Math. 95(1-3): 169-180 (1999) - [j29]Edward A. Bender, E. Rodney Canfield:
An Approximate Probabilistic Model for Structured Gaussian Elimination. J. Algorithms 31(2): 271-290 (1999) - 1998
- [j28]E. Rodney Canfield, Sylvie Corteel, Carla D. Savage:
Durfee Polynomials. Electron. J. Comb. 5 (1998) - [j27]E. Rodney Canfield:
The Size of the Largest Antichain in the Partition Lattice. J. Comb. Theory A 83(2): 188-201 (1998) - 1997
- [j26]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. Electron. J. Comb. 4(1) (1997) - [j25]E. Rodney Canfield:
From recursions to asymptotics: on Szekeres' formula for the number of partitions. Electron. J. Comb. 4(2) (1997) - [j24]Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Richmond:
Submap Density and Asymmetry Results for Two Parameter Map Families. Comb. Probab. Comput. 6(1): 17-25 (1997) - [j23]Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices. J. Comb. Theory A 80(1): 124-150 (1997) - [j22]Guo-Qiang Zhang, E. Rodney Canfield:
The End of Pumping? Theor. Comput. Sci. 174(1-2): 275-279 (1997) - 1996
- [j21]Edward A. Bender, E. Rodney Canfield:
Log-Concavity and Related Properties of the Cycle Index Polynomials. J. Comb. Theory A 74(1): 57-70 (1996) - 1995
- [j20]E. Rodney Canfield:
Engel's Inequality for Bell Numbers. J. Comb. Theory A 72(1): 184-187 (1995) - [j19]E. Rodney Canfield, L. H. Harper:
Large Antichains in the Partition Lattice. Random Struct. Algorithms 6(1): 89-104 (1995) - 1994
- [j18]Edward A. Bender, E. Rodney Canfield:
The Number of Degree-Restricted Rooted Maps on the Sphere. SIAM J. Discret. Math. 7(1): 9-15 (1994) - 1993
- [j17]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 A 63(2): 318-329 (1993) - [j16]E. Rodney Canfield:
Matchings in the Partition Lattice. SIAM J. Discret. Math. 6(1): 100-109 (1993) - 1992
- [j15]Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges. Australas. J Comb. 6: 119-124 (1992) - [j14]E. Rodney Canfield, David M. Jackson:
A D-finiteness result for products of permutations. Discret. Math. 99(1-3): 25-30 (1992) - [j13]Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
Asymptotic Properties of Labeled Connected Graphs. Random Struct. Algorithms 3(2): 183-202 (1992) - 1991
- [j12]Edward A. Bender, E. Rodney Canfield:
The number of rooted maps on an orientable surface. J. Comb. Theory B 53(2): 293-299 (1991) - [j11]E. Rodney Canfield:
Combinatorial Search (Martin Aigner). SIAM Rev. 33(1): 132-133 (1991) - [c1]Edward A. Bender, E. Rodney Canfield:
Enumeration of Degree Restricted Rooted Maps on the Sphere. Planar Graphs 1991: 13-16 - 1990
- [j10]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)
1980 – 1989
- 1989
- [j9]Edward A. Bender, E. Rodney Canfield:
Face sizes of 3-polytopes. J. Comb. Theory B 46(1): 58-65 (1989) - 1988
- [j8]Edward A. Bender, E. Rodney Canfield, Robert W. Robinson:
The asymptotic number of tree-rooted maps on a surface. J. Comb. Theory A 48(2): 156-164 (1988) - 1987
- [j7]E. Rodney Canfield, Nicholas C. Wormald:
Ménage numbers, bijections and P-recursiveness. Discret. Math. 63(2-3): 117-129 (1987) - 1986
- [j6]Edward A. Bender, E. Rodney Canfield:
The asymptotic number of rooted maps on a surface. J. Comb. Theory A 43(2): 244-257 (1986) - 1984
- [j5]E. Rodney Canfield:
Remarks on an Asymptotic Method in Combinatorics. J. Comb. Theory A 37(3): 348-352 (1984) - 1983
- [j4]Edward A. Bender, E. Rodney Canfield:
Enumeration of connected invariant graphs. J. Comb. Theory B 34(3): 268-278 (1983) - 1980
- [j3]E. Rodney Canfield:
Application of the Berry-Esséen Inequality to Combinatorial Estimates. J. Comb. Theory A 28(1): 17-25 (1980)
1970 – 1979
- 1978
- [j2]Edward A. Bender, E. Rodney Canfield:
The Asymptotic Number of Labeled Graphs with Given Degree Sequences. J. Comb. Theory A 24(3): 296-307 (1978) - 1977
- [j1]E. Rodney Canfield:
Central and Local Limit Theorems for the Coefficients of Polynomials of Binomial Type. J. Comb. Theory A 23(3): 275-290 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: