Edward A. Bender

Comb. Probab. Comput., 2014

2012

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

Asymptotic Enumeration of Labelled Graphs by Genus.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Asymptotics of Some Convolutional Recurrences.

[BibT_eX]

[DOI]

Adri B. Olde Daalhuis

Electron. J. Comb., 2010

Locally Restricted Compositions III. Adjacent-Part Periodic Inequalities.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

Locally Restricted Compositions II. General Restrictions and Infinite Matrices.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

The Map Asymptotics Constant tg.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Coefficients of Functional Compositions Often Grow Smoothly.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2005

Locally Restricted Compositions I. Restricted Adjacent Differences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

2004

Asymptotics of combinatorial structures with large smallest component.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2004

2003

Asymptotics of Permutations with Nearly Periodic Patterns of Rises and Falls.

[BibT_eX]

[DOI]

J. William Helton

Electron. J. Comb., 2003

A Discontinuity in the Distribution of Fixed Point Sums.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

2002

The Number of Labeled 2-Connected Planar Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2000

Asymptotics for the Probability of Connectedness and the Distribution of Number of Components.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

1999

Counting Methods.

[BibT_eX]

[DOI]

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

Sequences.

[BibT_eX]

[DOI]

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

0-1 laws for maps.

[BibT_eX]

[DOI]

Kevin J. Compton

Random Struct. Algorithms, 1999

An Approximate Probabilistic Model for Structured Gaussian Elimination.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Multivariate Asymptotics for Products of Large Powers with Applications to Lagrange Inversion.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Intersections of Randomly Embedded Sparse Graphs are Poisson.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

1998

Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks.

[BibT_eX]

[DOI]

S. Gill Williamson

Electron. J. Comb., 1998

A Multivariate Lagrange Inversion Formula for Asymptotic Calculations.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

1997

The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Submap Density and Asymmetry Results for Two Parameter Map Families.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

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

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

Mathematical methods in artificial intelligence.

[BibT_eX]

IEEE, ISBN: 978-0-8186-7200-2, 1997

1996

Log-Concavity and Related Properties of the Cycle Index Polynomials.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

Admissible Functions and Asymptotics for Labelled Structures by Number of Components.

[BibT_eX]

[DOI]

Electron. J. Comb., 1996

1995

Largest 4-Connected Components of 3-Connected Planar Triangulations.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

1994

The Number of Degree-Restricted Rooted Maps on the Sphere.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

1993

The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces.

[BibT_eX]

J. Comb. Theory A, 1993

The Distribution of Subword Counts is Usually Normal.

[BibT_eX]

[DOI]

Fred Kochman

Eur. J. Comb., 1993

1992

Asymptotic Properties of Labeled Connected Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

Submaps of maps. III. k-Connected nonplanar maps.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Submaps of maps. I. General 0-1 laws.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Submaps of maps. II. Cyclically k-connected planar cubic maps.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Enumeration of Subspaces by Dimension Sequence.

[BibT_eX]

J. Comb. Theory A, 1992

The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges.

[BibT_eX]

[DOI]

Australas. J Comb., 1992

1991

The number of rooted maps on an orientable surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Enumeration of Degree Restricted Rooted Maps on the Sphere.

[BibT_eX]

[DOI]

Proceedings of the Planar Graphs, 1991

Foundations of applied combinatorics.

[BibT_eX]

S. G. Williamson

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.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

3-edge-connected embeddings have few singular edges.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

1989

On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions.

[BibT_eX]

[DOI]

Jon T. Butler

IEEE Trans. Computers, 1989

Face sizes of 3-polytopes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

1988

The asymptotic number of rooted nonseparable maps on a surface.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

The asymptotic number of acyclic digraphs, II.

[BibT_eX]

[DOI]

Robert W. Robinson

J. Comb. Theory B, 1988

The asymptotic number of tree-rooted maps on a surface.

[BibT_eX]

[DOI]

Robert W. Robinson

J. Comb. Theory A, 1988

1987

Optimal Worst Case Trees.

[BibT_eX]

[DOI]

Cheryl E. Praeger

Acta Informatica, 1987

1986

Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities.

[BibT_eX]

[DOI]

J. Graph Theory, 1986

A survey of the asymptotic behaviour of maps.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

A generalisation of Canfield's formula.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

The asymptotic number of rooted maps on a surface.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

The asymptotic number of acyclic diagraphs I.

[BibT_eX]

[DOI]

Comb., 1986

1985

Enumeration of Structured Flowcharts

[BibT_eX]

[DOI]

Jon T. Butler

J. ACM, July, 1985

Some Asymptotic Bijections.

[BibT_eX]

[DOI]

Doron Zeilberger

J. Comb. Theory A, 1985

A Theoretical Analysis of Backtracking in the Graph Coloring Problem.

[BibT_eX]

[DOI]

Herbert S. Wilf

J. Algorithms, 1985

The Asymptotic Number of Irreducible Partitions.

[BibT_eX]

[DOI]

Andrew M. Odlyzko

Eur. J. Comb., 1985

The number of loopless planar maps.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

The asymptotic enumeration of rooted convex polyhedra.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

An asymptotic expansion for the coefficients of some power series II: Lagrange inversion.

[BibT_eX]

[DOI]

Discret. Math., 1984

Partitions of multisets II.

[BibT_eX]

[DOI]

John S. Devitt

Discret. Math., 1984

1983

Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions.

[BibT_eX]

[DOI]

S. G. Williamson

J. Comb. Theory A, 1983

Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Enumeration of connected invariant graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

1980

The Number of Fanout-Free Functions with Various Gates.

[BibT_eX]

[DOI]

J. ACM, 1980

1979

Surveyor's Forum: A Recurrent Problem.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1979

1978

Asymptotic Aproximations for the Number of Fanout-Free Functions.

[BibT_eX]

[DOI]

Jon T. Butler

IEEE Trans. Computers, 1978

The Asymptotic Number of Labeled Graphs with Given Degree Sequences.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1978

1974

On Buckhiester's Enumeration of n x n Matrices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1974

Convex n-ominoes.

[BibT_eX]

[DOI]

Discret. Math., 1974

Partitions of multisets.

[BibT_eX]

[DOI]

Discret. Math., 1974

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

[BibT_eX]

[DOI]

Discret. Math., 1974

1973

Central and Local Limit Theorems Applied to Asymptotic Enumeration.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1973

1972

Enumeration of Plane Partitions.

[BibT_eX]

[DOI]

Donald E. Knuth

J. Comb. Theory A, 1972

1971

A generalized q-binomial Vandermonde convolution.

[BibT_eX]

[DOI]