Edward A. Bender

According to our database1, Edward A. Bender
  • authored at least 75 papers between 1971 and 2014.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Part Sizes of Smooth Supercritical Compositional Structures.
Combinatorics, Probability & Computing, 2014

2012
Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness.
Electr. J. Comb., 2012

2011
Asymptotic Enumeration of Labelled Graphs by Genus.
Electr. J. Comb., 2011

2010
Asymptotics of Some Convolutional Recurrences.
Electr. J. Comb., 2010

Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities.
Electr. J. Comb., 2010

2009
Locally Restricted Compositions II. General Restrictions and Infinite Matrices.
Electr. J. Comb., 2009

2008
The Map Asymptotics Constant tg.
Electr. J. Comb., 2008

Coefficients of Functional Compositions Often Grow Smoothly.
Electr. J. Comb., 2008

2005
Locally Restricted Compositions I. Restricted Adjacent Differences.
Electr. J. Comb., 2005

2004
Asymptotics of combinatorial structures with large smallest component.
J. Comb. Theory, Ser. A, 2004

2003
Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls.
Electr. J. Comb., 2003

A Discontinuity in the Distribution of Fixed Point Sums.
Electr. J. Comb., 2003

2002
The Number of Labeled 2-Connected Planar Graphs.
Electr. J. Comb., 2002

2000
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components.
Electr. J. Comb., 2000

1999
Counting Methods.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Sequences.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

0-1 laws for maps.
Random Struct. Algorithms, 1999

An Approximate Probabilistic Model for Structured Gaussian Elimination.
J. Algorithms, 1999

Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion.
Electr. J. Comb., 1999

Intersections of Randomly Embedded Sparse Graphs are Poisson.
Electr. J. Comb., 1999

1998
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks.
Electr. J. Comb., 1998

A Multivariate Lagrange Inversion Formula for Asymptotic Calculations.
Electr. J. Comb., 1998

1997
The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices.
J. Comb. Theory, Ser. A, 1997

Submap Density and Asymmetry Results for Two Parameter Map Families.
Combinatorics, Probability & Computing, 1997

The Fraction of Subspaces of GF(q) n with a Specified Number of Minimal Weight Vectors is Asymptotically Poisson.
Electr. J. Comb., 1997

Mathematical methods in artificial intelligence.
IEEE, ISBN: 978-0-8186-7200-2, 1997

1996
Log-Concavity and Related Properties of the Cycle Index Polynomials.
J. Comb. Theory, Ser. A, 1996

Admissible Functions and Asymptotics for Labelled Structures by Number of Components.
Electr. J. Comb., 1996

1995
Largest 4-Connected Components of 3-Connected Planar Triangulations.
Random Struct. Algorithms, 1995

1994
The Number of Degree-Restricted Rooted Maps on the Sphere.
SIAM J. Discrete Math., 1994

1993
The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces.
J. Comb. Theory, Ser. A, 1993

The Distribution of Subword Counts is Usually Normal.
Eur. J. Comb., 1993

1992
Asymptotic Properties of Labeled Connected Graphs.
Random Struct. Algorithms, 1992

Submaps of maps. III. k-Connected nonplanar maps.
J. Comb. Theory, Ser. B, 1992

Submaps of maps. I. General 0-1 laws.
J. Comb. Theory, Ser. B, 1992

Submaps of maps. II. Cyclically k-connected planar cubic maps.
J. Comb. Theory, Ser. B, 1992

Enumeration of Subspaces by Dimension Sequence.
J. Comb. Theory, Ser. A, 1992

1991
The number of rooted maps on an orientable surface.
J. Comb. Theory, Ser. B, 1991

Enumeration of Degree Restricted Rooted Maps on the Sphere.
Proceedings of the Planar Graphs, 1991

Foundations of applied combinatorics.
Addison-Wesley, ISBN: 978-0-201-51039-3, 1991

1990
The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges.
Random Struct. Algorithms, 1990

3-edge-connected embeddings have few singular edges.
Journal of Graph Theory, 1990

1989
On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions.
IEEE Trans. Computers, 1989

Face sizes of 3-polytopes.
J. Comb. Theory, Ser. B, 1989

1988
The asymptotic number of rooted nonseparable maps on a surface.
J. Comb. Theory, Ser. A, 1988

The asymptotic number of acyclic digraphs, II.
J. Comb. Theory, Ser. B, 1988

The asymptotic number of tree-rooted maps on a surface.
J. Comb. Theory, Ser. A, 1988

1987
Optimal Worst Case Trees.
Acta Inf., 1987

1986
Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities.
Journal of Graph Theory, 1986

A survey of the asymptotic behaviour of maps.
J. Comb. Theory, Ser. B, 1986

A generalisation of Canfield's formula.
J. Comb. Theory, Ser. A, 1986

The asymptotic number of rooted maps on a surface.
J. Comb. Theory, Ser. A, 1986

The asymptotic number of acyclic diagraphs I.
Combinatorica, 1986

1985
Enumeration of Structured Flowcharts
J. ACM, July, 1985

Some Asymptotic Bijections.
J. Comb. Theory, Ser. A, 1985

A Theoretical Analysis of Backtracking in the Graph Coloring Problem.
J. Algorithms, 1985

The Asymptotic Number of Irreducible Partitions.
Eur. J. Comb., 1985

The number of loopless planar maps.
Discrete Mathematics, 1985

1984
The asymptotic enumeration of rooted convex polyhedra.
J. Comb. Theory, Ser. B, 1984

An asymptotic expansion for the coefficients of some power series II: Lagrange inversion.
Discrete Mathematics, 1984

Partitions of multisets II.
Discrete Mathematics, 1984

1983
Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions.
J. Comb. Theory, Ser. A, 1983

Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions.
J. Comb. Theory, Ser. A, 1983

Enumeration of connected invariant graphs.
J. Comb. Theory, Ser. B, 1983

1980
The Number of Fanout-Free Functions with Various Gates.
J. ACM, 1980

1979
Surveyor's Forum: A Recurrent Problem.
ACM Comput. Surv., 1979

1978
Asymptotic Aproximations for the Number of Fanout-Free Functions.
IEEE Trans. Computers, 1978

The Asymptotic Number of Labeled Graphs with Given Degree Sequences.
J. Comb. Theory, Ser. A, 1978

1974
On Buckhiester's Enumeration of n x n Matrices.
J. Comb. Theory, Ser. A, 1974

Convex n-ominoes.
Discrete Mathematics, 1974

Partitions of multisets.
Discrete Mathematics, 1974

The asymptotic number of non-negative integer matrices with given row and column sums.
Discrete Mathematics, 1974

1973
Central and Local Limit Theorems Applied to Asymptotic Enumeration.
J. Comb. Theory, Ser. A, 1973

1972
Enumeration of Plane Partitions.
J. Comb. Theory, Ser. A, 1972

1971
A generalized q-binomial Vandermonde convolution.
Discrete Mathematics, 1971


  Loading...