L. Bruce Richmond

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:r/LBruceRichmond · DBLP profile ↗

← Back

7ranked-venue papers

1as first author

0since 2021 · last 2012

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Combinatorics and discrete mathematics · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Combinatorics and discrete mathematics › enumeration combinatorial generation	0.0	1	1986	Constant Time Generation of Free Trees · SIAM J. Comput. 1986
Combinatorics and discrete mathematics › enumeration tree enumeration	0.0	1	1986	Constant Time Generation of Free Trees · SIAM J. Comput. 1986

Methods — techniques the papers use, named apart from their topics

constant amortized time algorithm · 0.0

Year	Publication	Venue	Position
2012	Interval Partitions and Polynomial Factorization Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond	Algorithmica	3
2006	Asymptotics of Largest Components in Combinatorial Structures Mohamed Omar, Daniel Panario, L. Bruce Richmond, Jacki Whitely	Algorithmica	3
2003	Stirling Numbers for Complex Arguments: Asymptotics and Identities abstract We derive asymptotic expansions for the Stirling numbers of real arguments as defined by Flajolet and Prodinger. We also generalize certain classical identities for Stirling numbers with integral arguments to real or complex arguments. Graeme Kemkes, Chiu Fan Lee, Donatella Merlini, L. Bruce Richmond	SIAM J. Discret. Math.	4
2001	Smallest Components in Decomposable Structures: Exp-Log Class Daniel Panario, L. Bruce Richmond	Algorithmica	2
2001	Exact Largest and Smallest Size of Components Daniel Panario, L. Bruce Richmond	Algorithmica	2
1997	Stirling Numbers for Complex Arguments abstract We define the Stirling numbers for complex values and obtain extensions of certain identities involving these numbers. We also show that the generalization is a natural one for proving unimodality and monotonicity results for these numbers. The definition is based on the Cauchy integral formula and can be used for many other combinatorial numbers. L. Bruce Richmond, Donatella Merlini	SIAM J. Discret. Math.	1
1986	Constant Time Generation of Free Trees abstract An algorithm of Beyer and Hedetniemi [SIAM J. Comput., 9 (1980), pp. 706–712] for generating rooted unlabeled trees is extended to generate unlabeled free trees. All the nonisomorphic trees of a given size are generated, without repetition, in time proportional to the number of trees. Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay	SIAM J. Comput.	2