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

Viktor Kudielka

dblp:24/367 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1966
—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
Coding theory · 44% Computational complexity · 44% Combinatorics and discrete mathematics · 13%

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

TopicWeightPapersLastEvidence papers
Coding theory
boolean functions		 0.011966
Complete Sets of Functions of Two and Three Binary Variables · IEEE Trans. Electron. Comput. 1966
Computational complexity › complexity classes
complete sets		 0.011966
Complete Sets of Functions of Two and Three Binary Variables · IEEE Trans. Electron. Comput. 1966
Combinatorics and discrete mathematics
enumeration		 0.011966
Complete Sets of Functions of Two and Three Binary Variables · IEEE Trans. Electron. Comput. 1966

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

cataloging · 0.0
YearPublicationVenuePosition
1966 Complete Sets of Functions of Two and Three Binary Variables
abstract
A catalog of all nonredundant complete sets of functions of two and three binary variables is presented in the form of a table.
Viktor Kudielka, P. Oliva
 IEEE Trans. Electron. Comput.1