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.
EDBT 2026 Demo / reviewers in the wild / expert

Yoshiro Kasahara

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

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

Applied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
1 paper
Algorithms and data structures · 77% Combinatorics and discrete mathematics · 23%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › data structure design › search structures
hashing		 0.011966
Analysis of the Address Assignment Problem for Clustered Keys · J. ACM 1966
Combinatorics and discrete mathematics
generating functions		 0.011966
Analysis of the Address Assignment Problem for Clustered Keys · J. ACM 1966

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

generating functions · 0.0
YearPublicationVenuePosition
1966 Analysis of the Address Assignment Problem for Clustered Keys
abstract
The occurrence pattern of clusterings of keys is analyzed by use of the generating function. Probabilities of occurrences of several clustered patterns are given as the coefficients of generating functions. Moreover, the result when a key-to-address transformation of aK + b /mod c is performed on clustered keys is briefly discussed.
Jun'ichi Toyoda, Yoshikazu Tezuka, Yoshiro Kasahara
 J. ACM3