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

T. C. Wesselkamper

dblp:06/1047 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1982
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory 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.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Theoretical computer science
2 papers
Graph algorithms and graph theory · 39% Information theory · 39% Coding theory · 22%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
program schemata		 0.011982
Computer Program Schemata and the Processes They Generate · IEEE Trans. Software Eng. 1982
Graph algorithms and graph theory
graph theory		 0.011982
Computer Program Schemata and the Processes They Generate · IEEE Trans. Software Eng. 1982
Information theory › probability theory › stochastic processes
markov processes		 0.011982
Computer Program Schemata and the Processes They Generate · IEEE Trans. Software Eng. 1982
Coding theory › finite fields
finite field arithmetic		 0.011978
Divided Difference Methods for Galois Switching Functions · IEEE Trans. Computers 1978

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

divided difference · 0.0
YearPublicationVenuePosition
1982 Computer Program Schemata and the Processes They Generate
abstract
This paper develops definitions for a program schema, the execution of such a program schema, and a process generated by a program schema. Results due to Hartfiel are used to characterize the cone of stochastic eigenvectors of the class of homogeneous Markov processes generated by a program schema. The stochastic behavior vector of a process generated by the same schema is shown to lie in this cone. In the case of a cyclic structured program schema, all of the vertices of the base of the cone are exactly generated by the circuits of the schema. Some directions for future work are suggested.
T. C. Wesselkamper
 IEEE Trans. Software Eng.1
1979 The algebraic representation of partial functions
T. C. Wesselkamper
 Discret. Appl. Math.1
1978 Divided Difference Methods for Galois Switching Functions
abstract
An alternative is provided to a recently published method of Benjauthrit and Reed for calculating the coefficients of the polynomial expansion of a given function. The method is exhibited for functions of one and two variables. The relative advantages and disadvantages of the two methods are discussed. Some empirical results are given for GF(9) and GF(16). It is shown that functions with DON'T CARE states are represented by a polynomial of minimal degree by this method.
T. C. Wesselkamper
 IEEE Trans. Computers1