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

Fumio Sato

dblp:35/1091 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

Theory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 1Security and privacy · 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › stream cipher
k-error linear complexity		 0.012000
A relationship between linear complexity and kapa-error linear complexity · IEEE Trans. Inf. Theory 2000
Cryptographic primitives and cryptanalysis
stream cipher		 0.012000
A relationship between linear complexity and kapa-error linear complexity · IEEE Trans. Inf. Theory 2000

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

sequence analysis · 0.0
YearPublicationVenuePosition
2011 Fast and Incremental Neural Associative Memory Based Approach for Adaptive Open-Loop Structural Control in High-Rise Buildings
Aram Kawewong, Yuji Koike, Osamu Hasegawa, Fumio Sato
 ICONIP (3)4
2000 A relationship between linear complexity and kapa-error linear complexity
abstract
Linear complexity is an important cryptographic criterion of stream ciphers. The k-error linear complexity of a periodic sequence of period N is defined as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This article shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.
Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto
 IEEE Trans. Inf. Theory2
1998 On the Randomness of a [d, k] Self-Decimation Stream Key Generator
Fumio Sato, Kaoru Kurosawa
 SETA1