Armin Hemmerling

According to our database, Armin Hemmerling authored at least 47 papers between 1976 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2015

Günter Asser (1926-2015).

Armin Hemmerling

Math. Log. Q., 2015

2013

On the Tape-Number Problem for Deterministic Time Classes.

Armin Hemmerling

CoRR, 2013

On Regular Sets of Bounds and Determinism versus Nondeterminism.

Armin Hemmerling

CoRR, 2013

2011

Observations on complete sets between linear time and polynomial time.

Armin Hemmerling

Inf. Comput., 2011

2010

Function operators spanning the arithmetical and the polynomial hierarchy.

Armin Hemmerling

RAIRO Theor. Informatics Appl., 2010

2008

Editorial: Math. Log. Quart. 2/2008.

Armin Hemmerling

Math. Log. Q., 2008

Hierarchies of function classes defined by the first-value operator.

Armin Hemmerling

RAIRO Theor. Informatics Appl., 2008

2007

Editorial: Math. Log. Quart. 1/2007.

Armin Hemmerling

Math. Log. Q., 2007

2006

Editorial: MLQ - Math. Log. Quart. 1/2006.

Armin Hemmerling

Math. Log. Q., 2006

The Hausdorff-Ershov Hierarchy in Euclidean Spaces.

Armin Hemmerling

Arch. Math. Log., 2006

2005

Letter from the outgoing Managing Editor/Letter from the new Managing Editor.

Günter Asser, Armin Hemmerling

Math. Log. Q., 2005

P=NP for some structures over the binary words.

Armin Hemmerling

J. Complex., 2005

2004

Characterizations of the class Delta^ta₂ over Euclidean spaces.

Armin Hemmerling

Math. Log. Q., 2004

Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract).

Armin Hemmerling

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

2003

The discrete parts of approximately decidable sets in Euclidean spaces.

Armin Hemmerling

Math. Log. Q., 2003

Approximate decidability in euclidean spaces.

Armin Hemmerling

Math. Log. Q., 2003

2002

Effective metric spaces and representations of the reals.

Armin Hemmerling

Theor. Comput. Sci., 2002

2001

On P Versus NP for Parameter-Free Programs Over Algebraic Structures.

Armin Hemmerling

Math. Log. Q., 2001

2000

On the Time Complexity of Partial Real Functions.

Armin Hemmerling

J. Complex., 2000

Standard Representations of Effective Metric Spaces.

Armin Hemmerling

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

On Approximate and Algebraic Computability over the Real Numbers.

Armin Hemmerling

Theor. Comput. Sci., 1999

1998

Computability Over Structures of Infinite Signature.

Armin Hemmerling

Math. Log. Q., 1998

Computability of String Functions Over Algebraic Structures.

Armin Hemmerling

Math. Log. Q., 1998

1994

Navigation Without Perception of Coordinates and Distances.

Armin Hemmerling

Math. Log. Q., 1994

On Genuine Complexity and Kinds of Nondeterminism.

Armin Hemmerling

J. Inf. Process. Cybern., 1994

1992

Traps for Jumping Multihead Counter Automata.

Mathias Bull, Armin Hemmerling

J. Inf. Process. Cybern., 1992

1991

Pebble Automata in Labyrinths with Rotation Systems.

Armin Hemmerling

Math. Log. Q., 1991

1990

Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata.

Mathias Bull, Armin Hemmerling

J. Inf. Process. Cybern., 1990

1987

Normed Two-Plane Traps for Finite Systems of Cooperating Compass Automata.

Armin Hemmerling

J. Inf. Process. Cybern., 1987

Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract).

Armin Hemmerling

Proceedings of the Fundamentals of Computation Theory, 1987

1986

1-Pointer Automata Searching Finite Plane Graphs.

Armin Hemmerling

Math. Log. Q., 1986

Real-time recognition of some languages by trellis and cellular automata and full scan Turing machines.

Armin Hemmerling

Bull. EATCS, 1986

Remark on the Power of Compass (Extended Abstract).

Armin Hemmerling

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1984

Zur Raumkompliziertheit mehrdimensionaler Turing-Automaten.

Armin Hemmerling, Gerd Murawski

Math. Log. Q., 1984

A searching algorithm for finite embedded D-graphs with no more than k regions.

Armin Hemmerling

Bull. EATCS, 1984

On Searching of Special Cases of Mazes and Finite Embedded Graphs.

Armin Hemmerling, Klaus Kriegel

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983

D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke.

Armin Hemmerling

J. Inf. Process. Cybern., 1983

1982

On the Computational Equivalence of Synchronous and Asynchronous Cellular Spaces.

Armin Hemmerling

J. Inf. Process. Cybern., 1982

1979

Turing-Automaten, Systeme von Turing-Automaten und Zellularräume in mehrdimensionalen Speichermedien.

Armin Hemmerling

PhD thesis, 1979

Zur Raumkompliziertheit mehrdimensionaler Zellularräume und Turing-Automaten.

Armin Hemmerling

J. Inf. Process. Cybern., 1979

Systeme von Turing-Automaten und Zellularräume auf rahmbaren Pseudomustermengen.

Armin Hemmerling

J. Inf. Process. Cybern., 1979

Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces.

Armin Hemmerling

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Realisierung der Verbandsopteratioen für Regulartiätsklassen von Kodierungen.

Armin Hemmerling

J. Inf. Process. Cybern., 1978

1977

Zur verallgemeinerten Realisierbarkeit von Pseudomusterfunktionen durch Zellularräume.

Armin Hemmerling

J. Inf. Process. Cybern., 1977

Allgemeine Untersuchungen zur Entscheidbarkeit und Trennbarkeit bezüglich Kodierungen.

Armin Hemmerling

J. Inf. Process. Cybern., 1977

Vergleich einiger Kodierungen der natürlichen Zahlen bezüglich der regulären Entscheidbarkeit von Zahlenmengen.

Armin Hemmerling

J. Inf. Process. Cybern., 1977

1976

Turing-Maschinen und Zellularräume in der Ebene.

Armin Hemmerling

J. Inf. Process. Cybern., 1976