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

Robert Alan Wright

dblp:73/6790 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1986
—ORCID · none

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

Theory of computation · 1 · 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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › enumeration
combinatorial generation		 0.011986
Constant Time Generation of Free Trees · SIAM J. Comput. 1986
Combinatorics and discrete mathematics › enumeration
tree enumeration		 0.011986
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
YearPublicationVenuePosition
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.1