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

Ernst-Jürgen Prauß

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

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

Theory of computation · 3

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
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity › computational models
alternation		 0.011978
On Alternation (Preliminary Version) · FOCS 1978
Computational complexity › complexity measures
turing machine complexity		 0.011978
On Alternation (Preliminary Version) · FOCS 1978

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

simulation · 0.0
YearPublicationVenuePosition
1980 On Alternation
Wolfgang J. Paul, Ernst-Jürgen Prauß, Rüdiger Reischuk
 Acta Informatica2
1980 Über Separatoren in planaren Graphen
Reiner Philipp, Ernst-Jürgen Prauß
 Acta Informatica2
1978 On Alternation (Preliminary Version)
abstract
Every alternating t(n) -time bounded multitape Turing machine can be simulated by an alternating t(n) -time bounded 1-tape Turing machine. Every nondeterministic t(n) -time bounded 1-tape Turing machine can be simulated by an alternating O(n+(t(n))1/2) -time bounded 1-tape Turing machine. For well-behaved functions t(n) every nondeterministic t(n) -time bounded 1-tape Turing machine can be simulated by a deterministic ((n log n)1/2 + (t(n))1/2) -tape bounded off-line Turing machine. These results improve or extend results by Chandra-Stockmeyer, Lipton-Tarjan and Paterson.
Wolfgang J. Paul, Ernst-Jürgen Prauß, Rüdiger Reischuk
 FOCS2