Demo Data from EDBT 2026 / reviewers in the wild / expert
Hans-Jörg Stoß
dblp:73/2879
· DBLP profile ↗
6ranked-venue papers
5as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 5 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.
| Theoretical computer science
1 paper |
Automata and formal languages · 67% Algorithms and data structures · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › turing machines
multihead turing machines |
0.0 | 1 | 1989 | Linear-Time Simulation of Multihead Turing Machines · Inf. Comput. 1989 |
Algorithms and data structures › randomized algorithms › sampling › markov chain monte carlo
simulation algorithms |
0.0 | 1 | 1989 | Linear-Time Simulation of Multihead Turing Machines · Inf. Comput. 1989 |
Automata and formal languages
turing machines |
0.0 | 1 | 1989 | Linear-Time Simulation of Multihead Turing Machines · Inf. Comput. 1989 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Linear-Time Simulation of Multihead Turing Machines
Hans-Jörg Stoß, Werner Schnitzlein |
Inf. Comput. | 1 |
| 1989 | On the Representation of Rational Functions of Bounded Complexity
Hans-Jörg Stoß |
Theor. Comput. Sci. | 1 |
| 1989 | Lower Bounds for the Complexity of Polynomials
Hans-Jörg Stoß |
Theor. Comput. Sci. | 1 |
| 1985 | The Complexity of Evaluating Interpolation Polynomials
Hans-Jörg Stoß |
Theor. Comput. Sci. | 1 |
| 1974 | Zur Komplexität von Sortierproblemen
Wolfgang J. Paul, Hans-Jörg Stoß |
Acta Informatica | 2 |
| 1973 | Rangierkomplexität von Permutationen
Hans-Jörg Stoß |
Acta Informatica | 1 |