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

Yu. L. Sagalovich

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

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

Systems, architecture and hardware · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › matrix theory
binary matrices		 0.011977
Comments on "On the Number of Classes of Binary Matrices" · IEEE Trans. Computers 1977
Combinatorics and discrete mathematics
enumeration		 0.011977
Comments on "On the Number of Classes of Binary Matrices" · IEEE Trans. Computers 1977
Combinatorics and discrete mathematics › group theory
permutation groups		 0.011977
Comments on "On the Number of Classes of Binary Matrices" · IEEE Trans. Computers 1977
YearPublicationVenuePosition
1977 Comments on "On the Number of Classes of Binary Matrices"
abstract
The solution to the problem of counting of m X n matrices of zeros and ones under 1) row and columns permutations and 2) row and columns permutations together with columns complementations is given in Harrison's1 paper. The first problem is more complicated than the second one, since the author claims the second is "an easy generalization" of the first.
Yu. L. Sagalovich
 IEEE Trans. Computers1