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

Shigeo Akashi

dblp:91/279 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · unresolved

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

Theory of computation · 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
Information theory · 50% Computational geometry · 50%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures
entropy		 0.011992
A relation between Kolmogorov-Prokhorov's condition and Ohya's fractal dimensions · IEEE Trans. Inf. Theory 1992
Computational geometry › fractal geometry
fractal dimension		 0.011992
A relation between Kolmogorov-Prokhorov's condition and Ohya's fractal dimensions · IEEE Trans. Inf. Theory 1992

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

kolmogorov-prokhorov condition · 0.0
YearPublicationVenuePosition
1992 A relation between Kolmogorov-Prokhorov's condition and Ohya's fractal dimensions
abstract
A computational method giving upper bounds of in -entropy of stochastic processes satisfying Kolmogorov-Prokhorov's condition is studied, in terms of Shannon's entropy of the probability measures on C
Shigeo Akashi
 IEEE Trans. Inf. Theory1