L. Bruce Richmond

  • University of Waterloo, Department of Mathematics, Canada

According to our database1, L. Bruce Richmond authored at least 56 papers between 1976 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Disjoint covering systems and the reversion of the Möbius series.
CoRR, 2017

The rth Smallest Part Size of a Random Integer Partition.
Integers, 2014

Counting the Palstars.
Electron. J. Comb., 2014

Interval Partitions and Polynomial Factorization.
Algorithmica, 2012

Asymptotics of smallest component sizes in decomposable structures of alg-log type.
Discret. Math. Theor. Comput. Sci., 2010

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

Bivariate Asymptotics for Striped Plane Partitions.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Counting Abelian Squares.
Electron. J. Comb., 2009

The Map Asymptotics Constant t<sub>g</sub>.
Electron. J. Comb., 2008

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

Asymptotics of Largest Components in Combinatorial Structures.
Algorithmica, 2006

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

A Simple Primality Test and th rth Smallest Prime Factor.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

Stirling Numbers for Complex Arguments: Asymptotics and Identities.
SIAM J. Discret. Math., 2003

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

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

Analysis of Rabin's irreducibility test for polynomials over finite fields.
Random Struct. Algorithms, 2001

Exact Largest and Smallest Size of Components.
Algorithmica, 2001

Smallest Components in Decomposable Structures: Exp-Log Class.
Algorithmica, 2001

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

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

The Asymptotic Number of Set Partitions with Unequal Block Sizes.
Electron. J. Comb., 1999

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

Analysis of Ben-Or's polynomial irreducibility test.
Random Struct. Algorithms, 1998

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

Stirling Numbers for Complex Arguments.
SIAM J. Discret. Math., 1997

Submap Density and Asymmetry Results for Two Parameter Map Families.
Comb. Probab. Comput., 1997

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

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

Almost All Maps Are Asymmetric.
J. Comb. Theory B, 1995

Root Vertex Valency Distributions of Rooted Maps and Rooted Triangulations.
Eur. J. Comb., 1994

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

The Distribution of Heights of Binary Trees and Other Simple Trees.
Comb. Probab. Comput., 1993

On graphical partitions.
Comb., 1993

Generalized Digital Trees and Their Difference-Differential Equations.
Random Struct. Algorithms, 1992

Enumeration of Almost-Convex Polygons on the Square Lattice.
Random Struct. Algorithms, 1992

Submaps of maps. III. <i>k</i>-Connected nonplanar maps.
J. Comb. Theory B, 1992

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

Submaps of maps. II. Cyclically <i>k</i>-connected planar cubic maps.
J. Comb. Theory B, 1992

The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line.
Comb., 1992

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

Random Triangulations of the Plane.
Eur. J. Comb., 1988

Constant Time Generation of Free Trees.
SIAM J. Comput., 1986

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

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

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

The asymptotic number of acyclic diagraphs I.
Comb., 1986

On the Number of Distinct Block Sizes in Partitions of a Set.
J. Comb. Theory A, 1985

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

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

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

Partitions of multisets II.
Discret. Math., 1984

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

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

On the Unimodality of some Partition Polynomials.
Eur. J. Comb., 1982

On Hamiltonian polygons.
J. Comb. Theory B, 1976