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

Kenneth R. Kaplan

dblp:173/4501 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1965
—ORCID · none

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

Systems, architecture and hardware · 2 · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 72% Electronic design automation · 28%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
stochastic modeling		 0.011963
Transients in Markov Chains · IEEE Trans. Electron. Comput. 1963
Electronic design automation › hardware verification and test › design for testability
test synthesis		 0.011965
Chebyshev Approximation and Threshold Functions · IEEE Trans. Electron. Comput. 1965

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

chebyshev approximation · 0.0
YearPublicationVenuePosition
1965 Chebyshev Approximation and Threshold Functions
abstract
Where previous authors have considered linear approximations with a minimum sum of squared differences, we consider, instead, Chehyshev linear approximations, which minimize the maximum deviation. We obtain thus: 1) A new characterization of threshold functions, 2) A characterization of optimal threshold realizations as being virtually identical to the Chebyshev-best linear approximations, and 3) A new insight into the test-synthesis problem with which we opened this note.
Kenneth R. Kaplan, Robert O. Winder
 IEEE Trans. Electron. Comput.1
1963 Transients in Markov Chains
Jack Sklansky, Kenneth R. Kaplan
 IEEE Trans. Electron. Comput.2