default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward A. Bender
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j71]Edward A. Bender, Zhicheng Gao:
Part Sizes of Smooth Supercritical Compositional Structures. Comb. Probab. Comput. 23(5): 686-716 (2014)- 2012
- [j70]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
- [j69]Edward A. Bender, Zhicheng Gao:
Asymptotic Enumeration of Labelled Graphs by Genus. Electron. J. Comb. 18(1) (2011) - 2010
- [j68]Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities. Electron. J. Comb. 17(1) (2010) - [j67]Edward A. Bender, Adri B. Olde Daalhuis, Zhicheng Gao, L. Bruce Richmond, Nicholas C. Wormald:
Asymptotics of Some Convolutional Recurrences. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j66]Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions II. General Restrictions and Infinite Matrices. Electron. J. Comb. 16(1) (2009) - 2008
- [j65]Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond:
Coefficients of Functional Compositions Often Grow Smoothly. Electron. J. Comb. 15(1) (2008) - [j64]Edward A. Bender, Zhicheng Gao, L. Bruce Richmond:
The Map Asymptotics Constant tg. Electron. J. Comb. 15(1) (2008) - 2005
- [j63]Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions I. Restricted Adjacent Differences. Electron. J. Comb. 12 (2005) - 2004
- [j62]Edward A. Bender, Atefeh Mashatan, Daniel Panario
, L. Bruce Richmond:
Asymptotics of combinatorial structures with large smallest component. J. Comb. Theory A 107(1): 117-125 (2004) - 2003
- [j61]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) - [j60]Edward A. Bender, J. William Helton, L. Bruce Richmond:
Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls. Electron. J. Comb. 10 (2003) - 2002
- [j59]Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald:
The Number of Labeled 2-Connected Planar Graphs. Electron. J. Comb. 9(1) (2002) - 2000
- [j58]Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond:
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1999
- [j57]Edward A. Bender, E. Rodney Canfield:
Intersections of Randomly Embedded Sparse Graphs are Poisson. Electron. J. Comb. 6 (1999) - [j56]Edward A. Bender, L. Bruce Richmond:
Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion. Electron. J. Comb. 6 (1999) - [j55]Edward A. Bender, E. Rodney Canfield:
An Approximate Probabilistic Model for Structured Gaussian Elimination. J. Algorithms 31(2): 271-290 (1999) - [j54]Edward A. Bender, Kevin J. Compton, L. Bruce Richmond:
0-1 laws for maps. Random Struct. Algorithms 14(3): 215-237 (1999) - [r2]Thomas A. Dowling, Ralph Peter Grimaldi, Jay Yellen, Victor S. Miller, Edward A. Bender:
Sequences. Handbook of Discrete and Combinatorial Mathematics 1999 - [r1]Jay Yellen, Edward W. Packel, Robert G. Rieper, George E. Andrews, Alan C. Tucker, Edward A. Bender, Bruce E. Sagan:
Counting Methods. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j53]Edward A. Bender, L. Bruce Richmond:
A Multivariate Lagrange Inversion Formula for Asymptotic Calculations. Electron. J. Comb. 5 (1998) - [j52]Edward A. Bender, S. Gill Williamson:
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks. Electron. J. Comb. 5 (1998) - 1997
- [b2]Edward A. Bender:
Mathematical methods in artificial intelligence. IEEE 1997, ISBN 978-0-8186-7200-2, pp. I-XX, 1-636 - [j51]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) - [j50]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) - [j49]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) - 1996
- [j48]Edward A. Bender, L. Bruce Richmond:
Admissible Functions and Asymptotics for Labelled Structures by Number of Components. Electron. J. Comb. 3(1) (1996) - [j47]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
- [j46]Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald:
Largest 4-Connected Components of 3-Connected Planar Triangulations. Random Struct. Algorithms 7(4): 273-286 (1995) - 1994
- [j45]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
- [j44]Edward A. Bender, Fred Kochman:
The Distribution of Subword Counts is Usually Normal. Eur. J. Comb. 14(4): 265-275 (1993) - [j43]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) - 1992
- [j42]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) - [j41]Edward A. Bender, Zhicheng Gao, L. Bruce Richmond:
Submaps of maps. I. General 0-1 laws. J. Comb. Theory B 55(1): 104-117 (1992) - [j40]Edward A. Bender, Zhicheng Gao, William McCuaig, L. Bruce Richmond:
Submaps of maps. II. Cyclically k-connected planar cubic maps. J. Comb. Theory B 55(1): 118-124 (1992) - [j39]Edward A. Bender, L. Bruce Richmond:
Submaps of maps. III. k-Connected nonplanar maps. J. Comb. Theory B 55(1): 125-132 (1992) - [j38]Edward A. Bender, Raymond Coley, David P. Robbins, Howard Rumsey Jr.:
Enumeration of Subspaces by Dimension Sequence. J. Comb. Theory A 59(1): 1-11 (1992) - [j37]Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
Asymptotic Properties of Labeled Connected Graphs. Random Struct. Algorithms 3(2): 183-202 (1992) - 1991
- [b1]Edward A. Bender, S. G. Williamson:
Foundations of applied combinatorics. Addison-Wesley 1991, ISBN 978-0-201-51039-3, pp. I-V, 1-425 - [j36]Edward A. Bender, E. Rodney Canfield:
The number of rooted maps on an orientable surface. J. Comb. Theory B 53(2): 293-299 (1991) - [c1]Edward A. Bender, E. Rodney Canfield:
Enumeration of Degree Restricted Rooted Maps on the Sphere. Planar Graphs 1991: 13-16 - 1990
- [j35]Edward A. Bender, L. Bruce Richmond:
3-edge-connected embeddings have few singular edges. J. Graph Theory 14(4): 475-477 (1990) - [j34]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
- [j33]Edward A. Bender, E. Rodney Canfield:
Face sizes of 3-polytopes. J. Comb. Theory B 46(1): 58-65 (1989) - [j32]Edward A. Bender, Jon T. Butler:
On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions. IEEE Trans. Computers 38(1): 82-98 (1989) - 1988
- [j31]Edward A. Bender, Robert W. Robinson:
The asymptotic number of acyclic digraphs, II. J. Comb. Theory B 44(3): 363-369 (1988) - [j30]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) - [j29]Edward A. Bender, Nicholas C. Wormald:
The asymptotic number of rooted nonseparable maps on a surface. J. Comb. Theory A 49(2): 370-380 (1988) - 1987
- [j28]Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald:
Optimal Worst Case Trees. Acta Informatica 24(4): 475-489 (1987) - 1986
- [j27]Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald:
The asymptotic number of acyclic diagraphs I. Comb. 6(1): 15-22 (1986) - [j26]Edward A. Bender, L. Bruce Richmond:
A survey of the asymptotic behaviour of maps. J. Comb. Theory B 40(3): 297-329 (1986) - [j25]Edward A. Bender, L. Bruce Richmond:
A generalisation of Canfield's formula. J. Comb. Theory A 41(1): 50-60 (1986) - [j24]Edward A. Bender, E. Rodney Canfield:
The asymptotic number of rooted maps on a surface. J. Comb. Theory A 43(2): 244-257 (1986) - [j23]Edward A. Bender, L. Bruce Richmond:
Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities. J. Graph Theory 10(1): 41-46 (1986) - 1985
- [j22]Edward A. Bender, Nicholas C. Wormald:
The number of loopless planar maps. Discret. Math. 54(2): 235-237 (1985) - [j21]Edward A. Bender, Andrew M. Odlyzko, L. Bruce Richmond:
The Asymptotic Number of Irreducible Partitions. Eur. J. Comb. 6(1): 1-6 (1985) - [j20]Edward A. Bender, Jon T. Butler:
Enumeration of Structured Flowcharts. J. ACM 32(3): 537-548 (1985) - [j19]Edward A. Bender, Herbert S. Wilf:
A Theoretical Analysis of Backtracking in the Graph Coloring Problem. J. Algorithms 6(2): 275-282 (1985) - [j18]Edward A. Bender, Doron Zeilberger:
Some Asymptotic Bijections. J. Comb. Theory A 38(1): 96-98 (1985) - 1984
- [j17]Edward A. Bender, John S. Devitt, L. Bruce Richmond:
Partitions of multisets II. Discret. Math. 50: 1-8 (1984) - [j16]Edward A. Bender, L. Bruce Richmond:
An asymptotic expansion for the coefficients of some power series II: Lagrange inversion. Discret. Math. 50: 135-141 (1984) - [j15]Edward A. Bender, L. Bruce Richmond:
The asymptotic enumeration of rooted convex polyhedra. J. Comb. Theory B 36(3): 276-283 (1984) - 1983
- [j14]Edward A. Bender, L. Bruce Richmond:
Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions. J. Comb. Theory A 34(3): 255-265 (1983) - [j13]Edward A. Bender, E. Rodney Canfield:
Enumeration of connected invariant graphs. J. Comb. Theory B 34(3): 268-278 (1983) - [j12]Edward A. Bender, L. Bruce Richmond, S. G. Williamson:
Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions. J. Comb. Theory A 35(3): 263-278 (1983) - 1980
- [j11]Edward A. Bender:
The Number of Fanout-Free Functions with Various Gates. J. ACM 27(1): 181-190 (1980)
1970 – 1979
- 1979
- [j10]Edward A. Bender:
Surveyor's Forum: A Recurrent Problem. ACM Comput. Surv. 11(1): 67-68 (1979) - 1978
- [j9]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) - [j8]Edward A. Bender, Jon T. Butler:
Asymptotic Aproximations for the Number of Fanout-Free Functions. IEEE Trans. Computers 27(12): 1180-1183 (1978) - 1974
- [j7]Edward A. Bender:
Convex n-ominoes. Discret. Math. 8(3): 219-226 (1974) - [j6]Edward A. Bender:
Partitions of multisets. Discret. Math. 9(4): 301-311 (1974) - [j5]Edward A. Bender:
The asymptotic number of non-negative integer matrices with given row and column sums. Discret. Math. 10(2): 217-223 (1974) - [j4]Edward A. Bender:
On Buckhiester's Enumeration of n x n Matrices. J. Comb. Theory A 17(2): 273-274 (1974) - 1973
- [j3]Edward A. Bender:
Central and Local Limit Theorems Applied to Asymptotic Enumeration. J. Comb. Theory A 15(1): 91-111 (1973) - 1972
- [j2]Edward A. Bender, Donald E. Knuth:
Enumeration of Plane Partitions. J. Comb. Theory A 13(1): 40-54 (1972) - 1971
- [j1]Edward A. Bender:
A generalized q-binomial Vandermonde convolution. Discret. Math. 1(2): 115-119 (1971)
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-06-10 21:26 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:
