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

Paul Schweizer

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

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

Artificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Theory 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
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
epistemic logic		 0.011991
A Metalinguistic Treatment of Epistemic Contexts · KR 1991
Programming languages and type systems › method dispatch
dynamic dispatch		 0.011989
A Fast Method Dispatcher for Compiled Languages with Multiple Inheritance · OOPSLA 1989
Programming languages and type systems › object-oriented programming
multiple inheritance		 0.011989
A Fast Method Dispatcher for Compiled Languages with Multiple Inheritance · OOPSLA 1989
Logic in computer science
semantics		 0.011991
A Metalinguistic Treatment of Epistemic Contexts · KR 1991

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

graph coloring · 0.0
YearPublicationVenuePosition
1991 A Metalinguistic Treatment of Epistemic Contexts
Paul Schweizer
 KR1
1989 A Fast Method Dispatcher for Compiled Languages with Multiple Inheritance
abstract
This paper addresses the problem of an efficient dispatch mechanism in an object-oriented system with multiple inheritance. The solution suggested is a direct table indexed branch such as is used in C++. The table slot assignments are made using a coloring algorithm. The method is applicable to strongly typed languages such as C++ (with multiple inheritance added) and Eiffel, and in a slightly slower form to less strongly typed languages like Objective C.
R. Dixon, T. McKee, Paul Schweizer, M. Vaughan
 OOPSLA3