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

Marvin Perlman

dblp:178/6076 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1970
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 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
Automata and formal languages · 39% Coding theory · 35% Graph algorithms and graph theory · 27%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
finite automata		 0.021970
The Decomposition of the States of a Linear Feedback Shift Register Into Cycles of Equal Length · IEEE Trans. Computers 1970
The Synthesis of Binary Sequence Detectors · IEEE Trans. Computers 1968
Graph algorithms and graph theory › graph decomposition
cycle decomposition		 0.011970
The Decomposition of the States of a Linear Feedback Shift Register Into Cycles of Equal Length · IEEE Trans. Computers 1970
Coding theory
linear feedback shift register		 0.011970
The Decomposition of the States of a Linear Feedback Shift Register Into Cycles of Equal Length · IEEE Trans. Computers 1970
Electronic design automation
logic synthesis		 0.011968
The Synthesis of Binary Sequence Detectors · IEEE Trans. Computers 1968
Electronic design automation › logic synthesis
sequential circuit synthesis		 0.011968
The Synthesis of Binary Sequence Detectors · IEEE Trans. Computers 1968
Coding theory › sequences
pseudorandom sequences		 0.011970
The Decomposition of the States of a Linear Feedback Shift Register Into Cycles of Equal Length · IEEE Trans. Computers 1970
Automata and formal languages › finite automata › sequential machines
state assignment		 0.011968
The Synthesis of Binary Sequence Detectors · IEEE Trans. Computers 1968

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

two-level logic minimization · 0.0linear recurrence · 0.0generating functions · 0.0boolean function minimization · 0.0
YearPublicationVenuePosition
1970 The Decomposition of the States of a Linear Feedback Shift Register Into Cycles of Equal Length
abstract
This paper presents a derivation of a linear feedback function for an r-stage feedback shift register that results in branchless less cycles of equal length. The linear recurrence relationship and generating function, which characterize the r-stage feedback shift register's behavior, are used to prove that each of the 2r states lie in cycles of equal length.
Marvin Perlman
 IEEE Trans. Computers1
1968 The Synthesis of Binary Sequence Detectors
abstract
Abstract—A method is presented for synthesizing a sequential network for detecting a given n-place nonperiodic binary sequence within a data stream. The n-place nonperiodic sequence is characterized as a binary (n, r) ring sequence. The state assignment for r 2-state memory elements is determined from an ordered set of n distinct subsequences r bits in length. The minimization of r simultaneous Boolean functions of r+l variables yields a representation of internal combinational logic in two-level form.
Marvin Perlman
 IEEE Trans. Computers1