Armin Hemmerling - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2015

Günter Asser (1926-2015)Armin Hemmerling. mlq, 61(3):127-131, 2015. [doi]

2011

Observations on complete sets between linear time and polynomial timeArmin Hemmerling. iandc, 209(2):173-182, 2011. [doi]

2010

Function operators spanning the arithmetical and the polynomial hierarchyArmin Hemmerling. ita, 44(3):379-418, 2010. [doi]

2008

Editorial: Math. Log. Quart. 2/2008Armin Hemmerling. mlq, 54(2):128, 2008. [doi]

Hierarchies of function classes defined by the first-value operatorArmin Hemmerling. ita, 42(2):253-270, 2008. [doi]

2007

Editorial: Math. Log. Quart. 1/2007Armin Hemmerling. mlq, 53(1):3, 2007. [doi]

2006

The Hausdorff-Ershov Hierarchy in Euclidean SpacesArmin Hemmerling. AML, 45(3):323-350, 2006. [doi]

Editorial: MLQ - Math. Log. Quart. 1/2006Armin Hemmerling. mlq, 52(1):3, 2006. [doi]

2005

Letter from the outgoing Managing Editor/Letter from the new Managing EditorGünter Asser, Armin Hemmerling. mlq, 51(1):3-4, 2005. [doi]

P=NP for some structures over the binary wordsArmin Hemmerling. jc, 21(4):557-578, 2005. [doi]

Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract)Armin Hemmerling. ENTCS, 120:59-72, 2005. [doi]

2004

Characterizations of the class Delta:::ta:::::2:: over Euclidean spacesArmin Hemmerling. mlq, 50(4-5):507-519, 2004. [doi]

2003

The discrete parts of approximately decidable sets in Euclidean spacesArmin Hemmerling. mlq, 49(4):428-432, 2003. [doi]

Approximate decidability in euclidean spacesArmin Hemmerling. mlq, 49(1):34-56, 2003. [doi]

2002

Effective metric spaces and representations of the realsArmin Hemmerling. TCS, 284(2):347-372, 2002. [doi]

2001

On P Versus NP for Parameter-Free Programs Over Algebraic StructuresArmin Hemmerling. mlq, 47(1):67-92, 2001. [doi]

2000

On the Time Complexity of Partial Real FunctionsArmin Hemmerling. jc, 16(1):363-376, 2000. [doi]

Standard Representations of Effective Metric SpacesArmin Hemmerling. cca 2001: 48-68 [doi]

1999

On Approximate and Algebraic Computability over the Real NumbersArmin Hemmerling. TCS, 219(1-2):185-223, 1999. [doi]

1998

Computability of String Functions Over Algebraic StructuresArmin Hemmerling. mlq, 44:1-44, 1998.

Computability Over Structures of Infinite SignatureArmin Hemmerling. mlq, 44:394-416, 1998.

1994

On Genuine Complexity and Kinds of NondeterminismArmin Hemmerling. eik, 30(2):77-96, 1994.

Navigation Without Perception of Coordinates and DistancesArmin Hemmerling. mlq, 40:237-260, 1994.

1992

Traps for Jumping Multihead Counter AutomataMathias Bull, Armin Hemmerling. eik, 28(6):343-361, 1992.

1991

Pebble Automata in Labyrinths with Rotation SystemsArmin Hemmerling. mlq, 37(26-30):453-466, 1991. [doi]

1990

Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite AutomataMathias Bull, Armin Hemmerling. eik, 26(1/2):65-73, 1990.

1987

Normed Two-Plane Traps for Finite Systems of Cooperating Compass AutomataArmin Hemmerling. eik, 23(8/9):453-470, 1987.

Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract)Armin Hemmerling. fct 1987: 197-203

1986

Remark on the Power of Compass (Extended Abstract)Armin Hemmerling. mfcs 1986: 405-413

Real-time recognition of some languages by trellis and cellular automata and full scan Turing machinesArmin Hemmerling. eatcs, 29:35-38, 1986.

1-Pointer Automata Searching Finite Plane GraphsArmin Hemmerling. mlq, 32(13-16):245-256, 1986. [doi]

1984

On Searching of Special Cases of Mazes and Finite Embedded GraphsArmin Hemmerling, Klaus Kriegel. mfcs 1984: 291-300

A searching algorithm for finite embedded D-graphs with no more than k regionsArmin Hemmerling. eatcs, 24:78-84, 1984.

Zur Raumkompliziertheit mehrdimensionaler Turing-AutomatenArmin Hemmerling, Gerd Murawski. mlq, 30(13-16):233-258, 1984. [doi]

1983

D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer RaumschrankeArmin Hemmerling. eik, 19(1/2):85-94, 1983.

1982

On the Computational Equivalence of Synchronous and Asynchronous Cellular SpacesArmin Hemmerling. eik, 18(7/8):423-434, 1982.

1979

Zur Raumkompliziertheit mehrdimensionaler Zellularräume und Turing-AutomatenArmin Hemmerling. eik, 15(3):143-158, 1979.

Systeme von Turing-Automaten und Zellularräume auf rahmbaren PseudomustermengenArmin Hemmerling. eik, 15(1/2):47-72, 1979.

Concentration of multidimensional tape-bounded systems of Turing automata and cellular spacesArmin Hemmerling. fct 1979: 167-174

Turing-Automaten, Systeme von Turing-Automaten und Zellularräume in mehrdimensionalen SpeichermedienArmin Hemmerling. PhD thesis, University of Greifswald, Germany, 1979. [doi]

1978

Realisierung der Verbandsopteratioen für Regulartiätsklassen von KodierungenArmin Hemmerling. eik, 14(3):145-152, 1978.

1977

Vergleich einiger Kodierungen der natürlichen Zahlen bezüglich der regulären Entscheidbarkeit von ZahlenmengenArmin Hemmerling. eik, 13(4/5):217-230, 1977.

Zur verallgemeinerten Realisierbarkeit von Pseudomusterfunktionen durch ZellularräumeArmin Hemmerling. eik, 13(10):523-528, 1977.

Allgemeine Untersuchungen zur Entscheidbarkeit und Trennbarkeit bezüglich KodierungenArmin Hemmerling. eik, 13(6):295-309, 1977.

1976

Turing-Maschinen und Zellularräume in der EbeneArmin Hemmerling. eik, 12(8/9):379-402, 1976.

Sign in or sign up to see more results.

runs on WebDSL