| |
| 2008 | ||
|---|---|---|
| 37 | EE | Armin Hemmerling: Editorial: Math. Log. Quart. 2/2008. Math. Log. Q. 54(2): 128 (2008) |
| 2007 | ||
| 36 | EE | Armin Hemmerling: Editorial: Math. Log. Quart. 1/2007. Math. Log. Q. 53(1): 3 (2007) |
| 2006 | ||
| 35 | EE | Armin Hemmerling: The Hausdorff-Ershov Hierarchy in Euclidean Spaces. Arch. Math. Log. 45(3): 323-350 (2006) |
| 34 | EE | Armin Hemmerling: Editorial: MLQ - Math. Log. Quart. 1/2006. Math. Log. Q. 52(1): 3 (2006) |
| 2005 | ||
| 33 | EE | Armin Hemmerling: Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 120: 59-72 (2005) |
| 32 | EE | Armin Hemmerling: P=NP for some structures over the binary words. J. Complexity 21(4): 557-578 (2005) |
| 31 | EE | Günter Asser, Armin Hemmerling: Letter from the outgoing Managing Editor/Letter from the new Managing Editor. Math. Log. Q. 51(1): 3-4 (2005) |
| 2004 | ||
| 30 | EE | Armin Hemmerling: Characterizations of the class Deltata2 over Euclidean spaces. Math. Log. Q. 50(4-5): 507-519 (2004) |
| 2003 | ||
| 29 | EE | Armin Hemmerling: Approximate decidability in euclidean spaces. Math. Log. Q. 49(1): 34-56 (2003) |
| 28 | EE | Armin Hemmerling: The discrete parts of approximately decidable sets in Euclidean spaces. Math. Log. Q. 49(4): 428-432 (2003) |
| 2002 | ||
| 27 | EE | Armin Hemmerling: Effective metric spaces and representations of the reals. Theor. Comput. Sci. 284(2): 347-372 (2002) |
| 2001 | ||
| 26 | EE | Armin Hemmerling: On P Versus NP for Parameter-Free Programs Over Algebraic Structures. Math. Log. Q. 47(1): 67-92 (2001) |
| 2000 | ||
| 25 | EE | Armin Hemmerling: Standard Representations of Effective Metric Spaces. CCA 2000: 48-68 |
| 24 | EE | Armin Hemmerling: On the Time Complexity of Partial Real Functions. J. Complexity 16(1): 363-376 (2000) |
| 1999 | ||
| 23 | EE | Armin Hemmerling: On Approximate and Algebraic Computability over the Real Numbers. Theor. Comput. Sci. 219(1-2): 185-223 (1999) |
| 1998 | ||
| 22 | Armin Hemmerling: Computability of String Functions Over Algebraic Structures. Math. Log. Q. 44: 1-44 (1998) | |
| 21 | Armin Hemmerling: Computability Over Structures of Infinite Signature. Math. Log. Q. 44: 394-416 (1998) | |
| 1994 | ||
| 20 | Armin Hemmerling: On Genuine Complexity and Kinds of Nondeterminism. Elektronische Informationsverarbeitung und Kybernetik 30(2): 77-96 (1994) | |
| 19 | Armin Hemmerling: Navigation Without Perception of Coordinates and Distances. Math. Log. Q. 40: 237-260 (1994) | |
| 1992 | ||
| 18 | Mathias Bull, Armin Hemmerling: Traps for Jumping Multihead Counter Automata. Elektronische Informationsverarbeitung und Kybernetik 28(6): 343-361 (1992) | |
| 1990 | ||
| 17 | Mathias Bull, Armin Hemmerling: Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata. Elektronische Informationsverarbeitung und Kybernetik 26(1/2): 65-73 (1990) | |
| 1987 | ||
| 16 | Armin Hemmerling: Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract). FCT 1987: 197-203 | |
| 15 | Armin Hemmerling: Normed Two-Plane Traps for Finite Systems of Cooperating Compass Automata. Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 453-470 (1987) | |
| 1986 | ||
| 14 | Armin Hemmerling: Remark on the Power of Compass (Extended Abstract). MFCS 1986: 405-413 | |
| 13 | Armin Hemmerling: Real-time recognition of some languages by trellis and cellular automata and full scan Turing machines. Bulletin of the EATCS 29: 35-38 (1986) | |
| 1984 | ||
| 12 | Armin Hemmerling, Klaus Kriegel: On Searching of Special Cases of Mazes and Finite Embedded Graphs. MFCS 1984: 291-300 | |
| 11 | Armin Hemmerling: A searching algorithm for finite embedded D-graphs with no more than k regions. Bulletin of the EATCS 24: 78-84 (1984) | |
| 1983 | ||
| 10 | Armin Hemmerling: D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke. Elektronische Informationsverarbeitung und Kybernetik 19(1/2): 85-94 (1983) | |
| 1982 | ||
| 9 | Armin Hemmerling: On the Computational Equivalence of Synchronous and Asynchronous Cellular Spaces. Elektronische Informationsverarbeitung und Kybernetik 18(7/8): 423-434 (1982) | |
| 1979 | ||
| 8 | Armin Hemmerling: Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces. FCT 1979: 167-174 | |
| 7 | Armin Hemmerling: Systeme von Turing-Automaten und Zellularräume auf rahmbaren Pseudomustermengen. Elektronische Informationsverarbeitung und Kybernetik 15(1/2): 47-72 (1979) | |
| 6 | Armin Hemmerling: Zur Raumkompliziertheit mehrdimensionaler Zellularräume und Turing-Automaten. Elektronische Informationsverarbeitung und Kybernetik 15(3): 143-158 (1979) | |
| 1978 | ||
| 5 | Armin Hemmerling: Realisierung der Verbandsopteratioen für Regulartiätsklassen von Kodierungen. Elektronische Informationsverarbeitung und Kybernetik 14(3): 145-152 (1978) | |
| 1977 | ||
| 4 | Armin Hemmerling: Zur verallgemeinerten Realisierbarkeit von Pseudomusterfunktionen durch Zellularräume. Elektronische Informationsverarbeitung und Kybernetik 13(10): 523-528 (1977) | |
| 3 | Armin Hemmerling: Vergleich einiger Kodierungen der natürlichen Zahlen bezüglich der regulären Entscheidbarkeit von Zahlenmengen. Elektronische Informationsverarbeitung und Kybernetik 13(4/5): 217-230 (1977) | |
| 2 | Armin Hemmerling: Allgemeine Untersuchungen zur Entscheidbarkeit und Trennbarkeit bezüglich Kodierungen. Elektronische Informationsverarbeitung und Kybernetik 13(6): 295-309 (1977) | |
| 1976 | ||
| 1 | Armin Hemmerling: Turing-Maschinen und Zellularräume in der Ebene. Elektronische Informationsverarbeitung und Kybernetik 12(8/9): 379-402 (1976) | |
| 1 | Günter Asser | [31] |
| 2 | Mathias Bull | [17] [18] |
| 3 | Klaus Kriegel | [12] |