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

G. Sourtziotis

dblp:60/6455 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—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 · 60% Distributed systems · 20% Integrated circuit design · 20%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital circuit design		 0.011995
On TSC Checkers for m-out-n Codes · IEEE Trans. Computers 1995
Distributed systems
fault tolerance		 0.011995
On TSC Checkers for m-out-n Codes · IEEE Trans. Computers 1995
Hardware reliability and fault tolerance › fault-tolerant design › fault-tolerant circuit design
m-out-of-n code checker		 0.011995
On TSC Checkers for m-out-n Codes · IEEE Trans. Computers 1995
Hardware reliability and fault tolerance
self-checking circuits		 0.011995
On TSC Checkers for m-out-n Codes · IEEE Trans. Computers 1995
Hardware reliability and fault tolerance › self-checking circuits
totally self-checking checker		 0.011995
On TSC Checkers for m-out-n Codes · IEEE Trans. Computers 1995
YearPublicationVenuePosition
1995 On TSC Checkers for m-out-n Codes
abstract
Paschalis et al. (1988) have given a structured method to design TSC m-out-of-2m code checkers suitable for VLSI implementation. In this correspondence we give sufficient conditions so that the method previously given can be used to design checkers for classes of m-out-of-n codes with n/spl ne/2m.>
Vassilios V. Dimakopoulos, G. Sourtziotis, Antonis M. Paschalis, Dimitris Nikolos
 IEEE Trans. Computers2