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

Susumu Aoyagi

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

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

Systems, architecture and hardware · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › fault-tolerant architecture
fault-tolerant sequential machine
0.011971
Failure-Tolerant Sequential Machines with Past Information · IEEE Trans. Computers 1971
Coding theory
error-correcting codes
0.011971
Failure-Tolerant Sequential Machines with Past Information · IEEE Trans. Computers 1971
YearPublicationVenuePosition
1971 Failure-Tolerant Sequential Machines with Past Information
abstract
A sequential machine must have certain redundant information in order to be capable of correcting error. As past inputs and past states are redundant, a sequential machine with error correction capability is constructable by making use of these elements of past information. This paper describes conditions of state assignments, numbers of required redundant state variables, and estimation of reliability of failure-tolerant sequential machines.
Yoshihiro Tohma, Susumu Aoyagi
IEEE Trans. Computers2