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

Florin Stuanciulescu

dblp:178/9217 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1968
—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
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › finite automata › sequential machines
sequential circuits		 0.011968
A Mathematical Model of Finite Random Sequential Automata · IEEE Trans. Computers 1968

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

sequential probability · 0.0
YearPublicationVenuePosition
1968 A Mathematical Model of Finite Random Sequential Automata
abstract
The sequential logic theory previously advanced[2]is generalized to operations between variables of maximum word length n. Based on the generalized sequential logic operations, a new kind of probability, termed sequential probability, is introduced. By means of sequential probability, a mathematical model can be obtained for finite random sequential automata. This model can be used for analysis and synthesis of random sequential automata.
Florin Stuanciulescu, Mihai Francisc Anton Oprescu
 IEEE Trans. Computers1