Demo Data from EDBT 2026 / reviewers in the wild / expert
Armin Hemmerling
dblp:59/4171
· DBLP profile ↗
9ranked-venue papers
9as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 9 · 9 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 |
Computational complexity · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › complexity classes
complete sets |
0.1 | 1 | 2011 | Observations on complete sets between linear time and polynomial time · Inf. Comput. 2011 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Observations on complete sets between linear time and polynomial time
Armin Hemmerling |
Inf. Comput. | 1 |
| 2005 | P=NP for some structures over the binary words
Armin Hemmerling |
J. Complex. | 1 |
| 2002 | Effective metric spaces and representations of the reals
Armin Hemmerling |
Theor. Comput. Sci. | 1 |
| 2000 | On the Time Complexity of Partial Real Functions
Armin Hemmerling |
J. Complex. | 1 |
| 1999 | On Approximate and Algebraic Computability over the Real Numbers
Armin Hemmerling |
Theor. Comput. Sci. | 1 |
| 1987 | Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract)
Armin Hemmerling |
FCT | 1 |
| 1986 | Remark on the Power of Compass (Extended Abstract)
Armin Hemmerling |
MFCS | 1 |
| 1984 | On Searching of Special Cases of Mazes and Finite Embedded Graphs
Armin Hemmerling, Klaus Kriegel |
MFCS | 1 |
| 1979 | Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces
Armin Hemmerling |
FCT | 1 |