Edward A. Bender

76 papers Journal 71Unranked 1

Year	Rank	Type	Title / Venue / Authors
2014	J	`jnl`	Part Sizes of Smooth Supercritical Compositional Structures. Comb. Probab. Comput. Edward A. Bender, Zhicheng Gao
2012	J	`jnl`	Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield, Zhicheng Gao
2011	J	`jnl`	Asymptotic Enumeration of Labelled Graphs by Genus. Electron. J. Comb. Edward A. Bender, Zhicheng Gao
2010	J	`jnl`	Asymptotics of Some Convolutional Recurrences. Electron. J. Comb. Edward A. Bender, Adri B. Olde Daalhuis, Zhicheng Gao, L. Bruce Richmond, Nicholas C. Wormald
2010	J	`jnl`	Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield
2009	J	`jnl`	Locally Restricted Compositions II. General Restrictions and Infinite Matrices. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield
2008	J	`jnl`	Coefficients of Functional Compositions Often Grow Smoothly. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond
2008	J	`jnl`	The Map Asymptotics Constant t Electron. J. Comb. Edward A. Bender, Zhicheng Gao, L. Bruce Richmond
2005	J	`jnl`	Locally Restricted Compositions I. Restricted Adjacent Differences. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield
2004	J	`jnl`	Asymptotics of combinatorial structures with large smallest component. J. Comb. Theory A Edward A. Bender, Atefeh Mashatan, Daniel Panario, L. Bruce Richmond
2003	J	`jnl`	A Discontinuity in the Distribution of Fixed Point Sums. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond, Herbert S. Wilf
2003	J	`jnl`	Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls. Electron. J. Comb. Edward A. Bender, J. William Helton, L. Bruce Richmond
2002	J	`jnl`	The Number of Labeled 2-Connected Planar Graphs. Electron. J. Comb. Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald
2000	J	`jnl`	Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. Electron. J. Comb. Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond
1999	J	`jnl`	0-1 laws for maps. Random Struct. Algorithms Edward A. Bender, Kevin J. Compton, L. Bruce Richmond
1999	J	`jnl`	An Approximate Probabilistic Model for Structured Gaussian Elimination. J. Algorithms Edward A. Bender, E. Rodney Canfield
1999	—	`ch.`	Counting Methods. Handbook of Discrete and Combinatorial Mathematics Jay Yellen, Edward W. Packel, Robert G. Rieper, George E. Andrews, Alan C. Tucker, Edward A. Bender, Bruce E. Sagan
1999	J	`jnl`	Intersections of Randomly Embedded Sparse Graphs are Poisson. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield
1999	J	`jnl`	Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion. Electron. J. Comb. Edward A. Bender, L. Bruce Richmond
1999	—	`ch.`	Sequences. Handbook of Discrete and Combinatorial Mathematics Thomas A. Dowling, Ralph Peter Grimaldi, Jay Yellen, Victor S. Miller, Edward A. Bender
1998	J	`jnl`	A Multivariate Lagrange Inversion Formula for Asymptotic Calculations. Electron. J. Comb. Edward A. Bender, L. Bruce Richmond
1998	J	`jnl`	Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks. Electron. J. Comb. Edward A. Bender, S. Gill Williamson
1997	—	`book`	Mathematical methods in artificial intelligence. Edward A. Bender
1997	J	`jnl`	Submap Density and Asymmetry Results for Two Parameter Map Families. Comb. Probab. Comput. Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Richmond
1997	J	`jnl`	The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices. J. Comb. Theory A Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1997	J	`jnl`	The Fraction of Subspaces of GF(q) n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson. Electron. J. Comb. Edward A. Bender, E. Rodney Canfield
1996	J	`jnl`	Admissible Functions and Asymptotics for Labelled Structures by Number of Components. Electron. J. Comb. Edward A. Bender, L. Bruce Richmond
1996	J	`jnl`	Log-Concavity and Related Properties of the Cycle Index Polynomials. J. Comb. Theory A Edward A. Bender, E. Rodney Canfield
1995	J	`jnl`	Largest 4-Connected Components of 3-Connected Planar Triangulations. Random Struct. Algorithms Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald
1994	J	`jnl`	The Number of Degree-Restricted Rooted Maps on the Sphere. SIAM J. Discret. Math. Edward A. Bender, E. Rodney Canfield
1993	J	`jnl`	The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces. J. Comb. Theory A Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond
1993	J	`jnl`	The Distribution of Subword Counts is Usually Normal. Eur. J. Comb. Edward A. Bender, Fred Kochman
1992	J	`jnl`	Asymptotic Properties of Labeled Connected Graphs. Random Struct. Algorithms Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1992	J	`jnl`	Enumeration of Subspaces by Dimension Sequence. J. Comb. Theory A Edward A. Bender, Raymond Coley, David P. Robbins, Howard Rumsey Jr.
1992	J	`jnl`	Submaps of maps. I. General 0-1 laws. J. Comb. Theory B Edward A. Bender, Zhicheng Gao, L. Bruce Richmond
1992	J	`jnl`	Submaps of maps. II. Cyclically J. Comb. Theory B Edward A. Bender, Zhicheng Gao, William McCuaig, L. Bruce Richmond
1992	J	`jnl`	Submaps of maps. III. J. Comb. Theory B Edward A. Bender, L. Bruce Richmond
1992	J	`jnl`	The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges. Australas. J Comb. Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1991	—	`conf`	Enumeration of Degree Restricted Rooted Maps on the Sphere. Planar Graphs Edward A. Bender, E. Rodney Canfield
1991	—	`book`	Foundations of applied combinatorics. Edward A. Bender, S. G. Williamson
1991	J	`jnl`	The number of rooted maps on an orientable surface. J. Comb. Theory B Edward A. Bender, E. Rodney Canfield
1990	J	`jnl`	3-edge-connected embeddings have few singular edges. J. Graph Theory Edward A. Bender, L. Bruce Richmond
1990	J	`jnl`	The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges. Random Struct. Algorithms Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1989	J	`jnl`	Face sizes of 3-polytopes. J. Comb. Theory B Edward A. Bender, E. Rodney Canfield
1989	J	`jnl`	On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions. IEEE Trans. Computers Edward A. Bender, Jon T. Butler
1988	J	`jnl`	The asymptotic number of acyclic digraphs, II. J. Comb. Theory B Edward A. Bender, Robert W. Robinson
1988	J	`jnl`	The asymptotic number of rooted nonseparable maps on a surface. J. Comb. Theory A Edward A. Bender, Nicholas C. Wormald
1988	J	`jnl`	The asymptotic number of tree-rooted maps on a surface. J. Comb. Theory A Edward A. Bender, E. Rodney Canfield, Robert W. Robinson
1987	J	`jnl`	Optimal Worst Case Trees. Acta Informatica Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald
1986	J	`jnl`	A generalisation of Canfield's formula. J. Comb. Theory A Edward A. Bender, L. Bruce Richmond
1986	J	`jnl`	A survey of the asymptotic behaviour of maps. J. Comb. Theory B Edward A. Bender, L. Bruce Richmond
1986	J	`jnl`	Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities. J. Graph Theory Edward A. Bender, L. Bruce Richmond
1986	J	`jnl`	The asymptotic number of acyclic diagraphs I. Comb. Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald
1986	J	`jnl`	The asymptotic number of rooted maps on a surface. J. Comb. Theory A Edward A. Bender, E. Rodney Canfield
1985	J	`jnl`	A Theoretical Analysis of Backtracking in the Graph Coloring Problem. J. Algorithms Edward A. Bender, Herbert S. Wilf
1985	J	`jnl`	Enumeration of Structured Flowcharts J. ACM Edward A. Bender, Jon T. Butler
1985	J	`jnl`	Some Asymptotic Bijections. J. Comb. Theory A Edward A. Bender, Doron Zeilberger
1985	J	`jnl`	The Asymptotic Number of Irreducible Partitions. Eur. J. Comb. Edward A. Bender, Andrew M. Odlyzko, L. Bruce Richmond
1985	J	`jnl`	The number of loopless planar maps. Discret. Math. Edward A. Bender, Nicholas C. Wormald
1984	J	`jnl`	An asymptotic expansion for the coefficients of some power series II: Lagrange inversion. Discret. Math. Edward A. Bender, L. Bruce Richmond
1984	J	`jnl`	Partitions of multisets II. Discret. Math. Edward A. Bender, John S. Devitt, L. Bruce Richmond
1984	J	`jnl`	The asymptotic enumeration of rooted convex polyhedra. J. Comb. Theory B Edward A. Bender, L. Bruce Richmond
1983	J	`jnl`	Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions. J. Comb. Theory A Edward A. Bender, L. Bruce Richmond
1983	J	`jnl`	Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions. J. Comb. Theory A Edward A. Bender, L. Bruce Richmond, S. G. Williamson
1983	J	`jnl`	Enumeration of connected invariant graphs. J. Comb. Theory B Edward A. Bender, E. Rodney Canfield
1980	J	`jnl`	The Number of Fanout-Free Functions with Various Gates. J. ACM Edward A. Bender
1979	J	`jnl`	Surveyor's Forum: A Recurrent Problem. ACM Comput. Surv. Edward A. Bender
1978	J	`jnl`	Asymptotic Aproximations for the Number of Fanout-Free Functions. IEEE Trans. Computers Edward A. Bender, Jon T. Butler
1978	J	`jnl`	The Asymptotic Number of Labeled Graphs with Given Degree Sequences. J. Comb. Theory A Edward A. Bender, E. Rodney Canfield
1974	J	`jnl`	Convex n-ominoes. Discret. Math. Edward A. Bender
1974	J	`jnl`	On Buckhiester's Enumeration of n x n Matrices. J. Comb. Theory A Edward A. Bender
1974	J	`jnl`	Partitions of multisets. Discret. Math. Edward A. Bender
1974	J	`jnl`	The asymptotic number of non-negative integer matrices with given row and column sums. Discret. Math. Edward A. Bender
1973	J	`jnl`	Central and Local Limit Theorems Applied to Asymptotic Enumeration. J. Comb. Theory A Edward A. Bender
1972	J	`jnl`	Enumeration of Plane Partitions. J. Comb. Theory A Edward A. Bender, Donald E. Knuth
1971	J	`jnl`	A generalized q-binomial Vandermonde convolution. Discret. Math. Edward A. Bender