Armin Hemmerling

Publication Activity (10 Years)

Years Active: 1976-2015
Publications (10 Years): 1

Top Venues

CoRR

Math. Log. Q.

University of Greifswald, Germany (PHD)

Education History

University of Greifswald, Germany

PHD

Publications

Armin Hemmerling
Günter Asser (1926-2015). Math. Log. Q. 61 (3) (2015)
Armin Hemmerling
On the Tape-Number Problem for Deterministic Time Classes. CoRR (2013)
Armin Hemmerling
On Regular Sets of Bounds and Determinism versus Nondeterminism. CoRR (2013)
Armin Hemmerling
Observations on complete sets between linear time and polynomial time. Inf. Comput. 209 (2) (2011)
Armin Hemmerling
Function operators spanning the arithmetical and the polynomial hierarchy. RAIRO Theor. Informatics Appl. 44 (3) (2010)
Armin Hemmerling
Hierarchies of function classes defined by the first-value operator. RAIRO Theor. Informatics Appl. 42 (2) (2008)
Armin Hemmerling
Editorial: Math. Log. Quart. 2/2008. Math. Log. Q. 54 (2) (2008)
Armin Hemmerling
Editorial: Math. Log. Quart. 1/2007. Math. Log. Q. 53 (1) (2007)
Armin Hemmerling
The Hausdorff-Ershov Hierarchy in Euclidean Spaces. Arch. Math. Log. 45 (3) (2006)
Armin Hemmerling
Editorial: MLQ - Math. Log. Quart. 1/2006. Math. Log. Q. 52 (1) (2006)
Armin Hemmerling
P=NP for some structures over the binary words. J. Complex. 21 (4) (2005)
Günter Asser, Armin Hemmerling
Letter from the outgoing Managing Editor/Letter from the new Managing Editor. Math. Log. Q. 51 (1) (2005)
Armin Hemmerling
Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 120 (2005)
Armin Hemmerling
over Euclidean spaces. Math. Log. Q. 50 (4-5) (2004)
Armin Hemmerling
Approximate decidability in euclidean spaces. Math. Log. Q. 49 (1) (2003)
Armin Hemmerling
The discrete parts of approximately decidable sets in Euclidean spaces. Math. Log. Q. 49 (4) (2003)
Armin Hemmerling
Effective metric spaces and representations of the reals. Theor. Comput. Sci. 284 (2) (2002)
Armin Hemmerling
On P Versus NP for Parameter-Free Programs Over Algebraic Structures. Math. Log. Q. 47 (1) (2001)
Armin Hemmerling
Standard Representations of Effective Metric Spaces. CCA (2000)
Armin Hemmerling
On the Time Complexity of Partial Real Functions. J. Complex. 16 (1) (2000)
Armin Hemmerling
On Approximate and Algebraic Computability over the Real Numbers. Theor. Comput. Sci. 219 (1-2) (1999)
Armin Hemmerling
Computability of String Functions Over Algebraic Structures. Math. Log. Q. 44 (1998)
Armin Hemmerling
Computability Over Structures of Infinite Signature. Math. Log. Q. 44 (1998)
Armin Hemmerling
On Genuine Complexity and Kinds of Nondeterminism. J. Inf. Process. Cybern. 30 (2) (1994)
Armin Hemmerling
Navigation Without Perception of Coordinates and Distances. Math. Log. Q. 40 (1994)
Mathias Bull, Armin Hemmerling
Traps for Jumping Multihead Counter Automata. J. Inf. Process. Cybern. 28 (6) (1992)
Armin Hemmerling
Pebble Automata in Labyrinths with Rotation Systems. Math. Log. Q. 37 (26-30) (1991)
Mathias Bull, Armin Hemmerling
Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata. J. Inf. Process. Cybern. 26 (1/2) (1990)
Armin Hemmerling
Normed Two-Plane Traps for Finite Systems of Cooperating Compass Automata. J. Inf. Process. Cybern. 23 (8/9) (1987)
Armin Hemmerling
Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract). FCT (1987)
Armin Hemmerling
Real-time recognition of some languages by trellis and cellular automata and full scan Turing machines. Bull. EATCS 29 (1986)
Armin Hemmerling
Remark on the Power of Compass (Extended Abstract). MFCS (1986)
Armin Hemmerling
1-Pointer Automata Searching Finite Plane Graphs. Math. Log. Q. 32 (13-16) (1986)
Armin Hemmerling, Klaus Kriegel
On Searching of Special Cases of Mazes and Finite Embedded Graphs. MFCS (1984)
Armin Hemmerling
A searching algorithm for finite embedded D-graphs with no more than k regions. Bull. EATCS 24 (1984)
Armin Hemmerling, Gerd Murawski
Zur Raumkompliziertheit mehrdimensionaler Turing-Automaten. Math. Log. Q. 30 (13-16) (1984)
Armin Hemmerling
D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke. J. Inf. Process. Cybern. 19 (1/2) (1983)
Armin Hemmerling
On the Computational Equivalence of Synchronous and Asynchronous Cellular Spaces. J. Inf. Process. Cybern. 18 (7/8) (1982)
Armin Hemmerling
Zur Raumkompliziertheit mehrdimensionaler Zellularräume und Turing-Automaten. J. Inf. Process. Cybern. 15 (3) (1979)
Armin Hemmerling
Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces. FCT (1979)
Armin Hemmerling
Systeme von Turing-Automaten und Zellularräume auf rahmbaren Pseudomustermengen. J. Inf. Process. Cybern. 15 (1/2) (1979)
Armin Hemmerling
Realisierung der Verbandsopteratioen für Regulartiätsklassen von Kodierungen. J. Inf. Process. Cybern. 14 (3) (1978)
Armin Hemmerling
Zur verallgemeinerten Realisierbarkeit von Pseudomusterfunktionen durch Zellularräume. J. Inf. Process. Cybern. 13 (10) (1977)
Armin Hemmerling
Allgemeine Untersuchungen zur Entscheidbarkeit und Trennbarkeit bezüglich Kodierungen. J. Inf. Process. Cybern. 13 (6) (1977)
Armin Hemmerling
Vergleich einiger Kodierungen der natürlichen Zahlen bezüglich der regulären Entscheidbarkeit von Zahlenmengen. J. Inf. Process. Cybern. 13 (4/5) (1977)
Armin Hemmerling
Turing-Maschinen und Zellularräume in der Ebene. J. Inf. Process. Cybern. 12 (8/9) (1976)

Armin Hemmerling.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Armin Hemmerling