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 SIGIR 2026 / reviewers in the wild / expert

David M. Perlman

dblp:47/5836 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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 · 70% Algorithms and data structures · 30%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › search algorithms
backtracking		 0.011974
Isomorph Rejection on Power Sets · SIAM J. Comput. 1974
Combinatorics and discrete mathematics › group theory
group actions		 0.011974
Isomorph Rejection on Power Sets · SIAM J. Comput. 1974
Combinatorics and discrete mathematics
isomorph rejection		 0.011974
Isomorph Rejection on Power Sets · SIAM J. Comput. 1974

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

backtracking · 0.0
YearPublicationVenuePosition
1974 Isomorph Rejection on Power Sets
abstract
If X is a finite set and G a finite group acting on X, then an action of G on $P(X)$, the set of all subsets of X, is induced in a natural way. An efficient generating algorithm is described which, when incorporated into a backtrack procedure, produces a system of distinct representatives for the action of G on $P(X)$.
David M. Perlman
 SIAM J. Comput.1