Armin Hemmerling

According to our database1, Armin Hemmerling authored at least 45 papers between 1976 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2015
Günter Asser (1926-2015).
Math. Log. Q., 2015

2011
Observations on complete sets between linear time and polynomial time.
Inf. Comput., 2011

2010
Function operators spanning the arithmetical and the polynomial hierarchy.
RAIRO - Theor. Inf. and Applic., 2010

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

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

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

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

The Hausdorff-Ershov Hierarchy in Euclidean Spaces.
Arch. Math. Log., 2006

2005
Letter from the outgoing Managing Editor/Letter from the new Managing Editor.
Math. Log. Q., 2005

P=NP for some structures over the binary words.
J. Complexity, 2005

Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2005

2004
Characterizations of the class Deltata2 over Euclidean spaces.
Math. Log. Q., 2004

2003
The discrete parts of approximately decidable sets in Euclidean spaces.
Math. Log. Q., 2003

Approximate decidability in euclidean spaces.
Math. Log. Q., 2003

2002
Effective metric spaces and representations of the reals.
Theor. Comput. Sci., 2002

2001
On P Versus NP for Parameter-Free Programs Over Algebraic Structures.
Math. Log. Q., 2001

2000
On the Time Complexity of Partial Real Functions.
J. Complexity, 2000

Standard Representations of Effective Metric Spaces.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999
On Approximate and Algebraic Computability over the Real Numbers.
Theor. Comput. Sci., 1999

1998
Computability Over Structures of Infinite Signature.
Math. Log. Q., 1998

Computability of String Functions Over Algebraic Structures.
Math. Log. Q., 1998

1994
Navigation Without Perception of Coordinates and Distances.
Math. Log. Q., 1994

On Genuine Complexity and Kinds of Nondeterminism.
Elektronische Informationsverarbeitung und Kybernetik, 1994

1992
Traps for Jumping Multihead Counter Automata.
Elektronische Informationsverarbeitung und Kybernetik, 1992

1991
Pebble Automata in Labyrinths with Rotation Systems.
Math. Log. Q., 1991

1990
Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata.
Elektronische Informationsverarbeitung und Kybernetik, 1990

1987
Normed Two-Plane Traps for Finite Systems of Cooperating Compass Automata.
Elektronische Informationsverarbeitung und Kybernetik, 1987

Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 1987

1986
1-Pointer Automata Searching Finite Plane Graphs.
Math. Log. Q., 1986

Real-time recognition of some languages by trellis and cellular automata and full scan Turing machines.
Bulletin of the EATCS, 1986

Remark on the Power of Compass (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1984
Zur Raumkompliziertheit mehrdimensionaler Turing-Automaten.
Math. Log. Q., 1984

A searching algorithm for finite embedded D-graphs with no more than k regions.
Bulletin of the EATCS, 1984

On Searching of Special Cases of Mazes and Finite Embedded Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke.
Elektronische Informationsverarbeitung und Kybernetik, 1983

1982
On the Computational Equivalence of Synchronous and Asynchronous Cellular Spaces.
Elektronische Informationsverarbeitung und Kybernetik, 1982

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

Zur Raumkompliziertheit mehrdimensionaler Zellularräume und Turing-Automaten.
Elektronische Informationsverarbeitung und Kybernetik, 1979

Systeme von Turing-Automaten und Zellularräume auf rahmbaren Pseudomustermengen.
Elektronische Informationsverarbeitung und Kybernetik, 1979

Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces.
Proceedings of the Fundamentals of Computation Theory, 1979

1978
Realisierung der Verbandsopteratioen für Regulartiätsklassen von Kodierungen.
Elektronische Informationsverarbeitung und Kybernetik, 1978

1977
Zur verallgemeinerten Realisierbarkeit von Pseudomusterfunktionen durch Zellularräume.
Elektronische Informationsverarbeitung und Kybernetik, 1977

Allgemeine Untersuchungen zur Entscheidbarkeit und Trennbarkeit bezüglich Kodierungen.
Elektronische Informationsverarbeitung und Kybernetik, 1977

Vergleich einiger Kodierungen der natürlichen Zahlen bezüglich der regulären Entscheidbarkeit von Zahlenmengen.
Elektronische Informationsverarbeitung und Kybernetik, 1977

1976
Turing-Maschinen und Zellularräume in der Ebene.
Elektronische Informationsverarbeitung und Kybernetik, 1976


  Loading...