Armin Hemmerling

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