Sergiu Rudeanu

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

dblp:17/5272 · DBLP profile ↗

← Back

8ranked-venue papers

6as first author

0since 2021 · last 2010

—ORCID · none

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

Systems, architecture and hardware · 3 · 3 first-authorTheory of computation · 3 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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

2 papers

Logic in computer science · 85% Coding theory · 7% Algorithms and data structures · 7%

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

Topic	Papers	Last	Evidence papers
Logic in computer science › algebraic logic boolean algebra	2	1976	Square Roots and Functional Decompositions of Boolean Functions · IEEE Trans. Computers 1976 An Algebraic Approach to Boolean Equations · IEEE Trans. Computers 1974
Logic in computer science › algebraic logic › boolean algebra › boolean function representation functional decomposition	1	1976	Square Roots and Functional Decompositions of Boolean Functions · IEEE Trans. Computers 1976
Logic in computer science › algebraic logic › boolean algebra boolean equation solving	1	1974	An Algebraic Approach to Boolean Equations · IEEE Trans. Computers 1974
Coding theory boolean functions	1	1976	Square Roots and Functional Decompositions of Boolean Functions · IEEE Trans. Computers 1976
Algorithms and data structures › algebraic computation › arithmetic algorithms square root algorithm	1	1976	Square Roots and Functional Decompositions of Boolean Functions · IEEE Trans. Computers 1976

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

serikov theorem · 0.0löwenheim formula · 0.0

Year	Publication	Venue	Position
2010	Boolean sets and most general solutions of Boolean equations Sergiu Rudeanu	Inf. Sci.	1
2009	Final and sequential behaviours of M-automata Gabriel Ciobanu, Sergiu Rudeanu	Acta Informatica	2
2005	Proving as a Computable Procedure Cristian S. Calude, Sergiu Rudeanu	Fundam. Informaticae	2
2004	Semirings in Operations Research and Computer Science: More Algebra Sergiu Rudeanu, Dragos Vaida	Fundam. Informaticae	1
1995	On quadratic Boolean equations Sergiu Rudeanu	Fuzzy Sets Syst.	1
1976	Square Roots and Functional Decompositions of Boolean Functions abstract A square root of an isotone Boolean function f with respect to a variable xi was defined by Reischer and Simovici [10] as a Boolean function s such that holds identically. More generally, given a partition (T,Y,Z) of the set X = (x1,···,xn) of variables, we may be interested in finding a functional decomposition of the form Sergiu Rudeanu	IEEE Trans. Computers	1
1974	An Algebraic Approach to Boolean Equations abstract A generalization of the Löwenheim formula for the solutions of a Boolean equation was recently obtained by Ju. A. Serikov. In this correspondence the Serikov theorem is written in a somewhat simpler form and it is shown that it can also be viewed as a particular case of the classical Löwenheim formula. Sergiu Rudeanu	IEEE Trans. Computers	1
1965	On Tohma's Decompositions of Logical Functions Sergiu Rudeanu	IEEE Trans. Electron. Comput.	1