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

Gideon Ehrlich

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

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

Applied, interdisciplinary, general and emerging computing · 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 · 50% Coding theory · 50%

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.011973
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations · J. ACM 1973
Coding theory › error-correcting codes › combinatorial coding theory
gray codes		 0.011973
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations · J. ACM 1973
YearPublicationVenuePosition
1973 Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
abstract
The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.
Gideon Ehrlich
 J. ACM1