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

Johannes M. Schumacher

dblp:34/5217 · also Hans Schumacher 0001 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2004
0000-0001-5753-3412ORCID · verified

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

Systems, architecture and hardware · 1Theory of computation · 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
Coding theory · 50% Logic in computer science · 25% Mathematical optimization · 25%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › code construction
algebraic construction		 0.011996
On behaviors and convolutional codes · IEEE Trans. Inf. Theory 1996
Logic in computer science › algebraic specification
behavioral specification		 0.011996
On behaviors and convolutional codes · IEEE Trans. Inf. Theory 1996
Coding theory › error-correcting codes
convolutional codes		 0.011996
On behaviors and convolutional codes · IEEE Trans. Inf. Theory 1996
Mathematical optimization › continuous optimization › convex optimization
first-order methods		 0.011996
On behaviors and convolutional codes · IEEE Trans. Inf. Theory 1996

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

systems theory · 0.0duality · 0.0
YearPublicationVenuePosition
2004 An irregular grid method for high-dimensional free-boundary problems in finance
Steffan Berridge, Johannes M. Schumacher
 Future Gener. Comput. Syst.2
1996 On behaviors and convolutional codes
abstract
It is well known that a convolutional code is essentially a linear system defined over a finite field. In this paper we elaborate on this connection. We define a convolutional code as the dual of a complete linear behavior in the sense of Willems (1979). Using ideas from systems theory, we describe a set of generalized first-order descriptions for convolutional codes. As an application of these ideas, we present a new algebraic construction for convolutional codes.
Joachim Rosenthal, Johannes M. Schumacher, Eric V. York
 IEEE Trans. Inf. Theory2