default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmin Hemmerling
Person information
- affiliation: Ernst-Moritz-Arndt-Universität Greifswald, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j38]Armin Hemmerling:
Günter Asser (1926-2015). Math. Log. Q. 61(3): 127-131 (2015)- 2013
- [i2]Armin Hemmerling:
On Regular Sets of Bounds and Determinism versus Nondeterminism. CoRR abs/1309.5862 (2013) - [i1]Armin Hemmerling:
On the Tape-Number Problem for Deterministic Time Classes. CoRR abs/1309.7457 (2013) - 2011
- [j37]Armin Hemmerling:
Observations on complete sets between linear time and polynomial time. Inf. Comput. 209(2): 173-182 (2011) - 2010
- [j36]Armin Hemmerling:
Function operators spanning the arithmetical and the polynomial hierarchy. RAIRO Theor. Informatics Appl. 44(3): 379-418 (2010)
2000 – 2009
- 2008
- [j35]Armin Hemmerling:
Hierarchies of function classes defined by the first-value operator. RAIRO Theor. Informatics Appl. 42(2): 253-270 (2008) - [j34]Armin Hemmerling:
Editorial: Math. Log. Quart. 2/2008. Math. Log. Q. 54(2): 128 (2008) - 2007
- [j33]Armin Hemmerling:
Editorial: Math. Log. Quart. 1/2007. Math. Log. Q. 53(1): 3 (2007) - 2006
- [j32]Armin Hemmerling:
The Hausdorff-Ershov Hierarchy in Euclidean Spaces. Arch. Math. Log. 45(3): 323-350 (2006) - [j31]Armin Hemmerling:
Editorial: MLQ - Math. Log. Quart. 1/2006. Math. Log. Q. 52(1): 3 (2006) - 2005
- [j30]Armin Hemmerling:
P=NP for some structures over the binary words. J. Complex. 21(4): 557-578 (2005) - [j29]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
- [j28]Armin Hemmerling:
Characterizations of the class Deltata2 over Euclidean spaces. Math. Log. Q. 50(4-5): 507-519 (2004) - [c6]Armin Hemmerling:
Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract). CCA 2004: 59-72 - 2003
- [j27]Armin Hemmerling:
Approximate decidability in euclidean spaces. Math. Log. Q. 49(1): 34-56 (2003) - [j26]Armin Hemmerling:
The discrete parts of approximately decidable sets in Euclidean spaces. Math. Log. Q. 49(4): 428-432 (2003) - 2002
- [j25]Armin Hemmerling:
Effective metric spaces and representations of the reals. Theor. Comput. Sci. 284(2): 347-372 (2002) - 2001
- [j24]Armin Hemmerling:
On P Versus NP for Parameter-Free Programs Over Algebraic Structures. Math. Log. Q. 47(1): 67-92 (2001) - 2000
- [j23]Armin Hemmerling:
On the Time Complexity of Partial Real Functions. J. Complex. 16(1): 363-376 (2000) - [c5]Armin Hemmerling:
Standard Representations of Effective Metric Spaces. CCA 2000: 48-68
1990 – 1999
- 1999
- [j22]Armin Hemmerling:
On Approximate and Algebraic Computability over the Real Numbers. Theor. Comput. Sci. 219(1-2): 185-223 (1999) - 1998
- [j21]Armin Hemmerling:
Computability of String Functions Over Algebraic Structures. Math. Log. Q. 44: 1-44 (1998) - [j20]Armin Hemmerling:
Computability Over Structures of Infinite Signature. Math. Log. Q. 44: 394-416 (1998) - 1994
- [j19]Armin Hemmerling:
On Genuine Complexity and Kinds of Nondeterminism. J. Inf. Process. Cybern. 30(2): 77-96 (1994) - [j18]Armin Hemmerling:
Navigation Without Perception of Coordinates and Distances. Math. Log. Q. 40: 237-260 (1994) - 1992
- [j17]Mathias Bull, Armin Hemmerling:
Traps for Jumping Multihead Counter Automata. J. Inf. Process. Cybern. 28(6): 343-361 (1992) - 1991
- [j16]Armin Hemmerling:
Pebble Automata in Labyrinths with Rotation Systems. Math. Log. Q. 37(26-30): 453-466 (1991) - 1990
- [j15]Mathias Bull, Armin Hemmerling:
Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata. J. Inf. Process. Cybern. 26(1/2): 65-73 (1990)
1980 – 1989
- 1987
- [j14]Armin Hemmerling:
Normed Two-Plane Traps for Finite Systems of Cooperating Compass Automata. J. Inf. Process. Cybern. 23(8/9): 453-470 (1987) - [c4]Armin Hemmerling:
Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract). FCT 1987: 197-203 - 1986
- [j13]Armin Hemmerling:
Real-time recognition of some languages by trellis and cellular automata and full scan Turing machines. Bull. EATCS 29: 35-38 (1986) - [j12]Armin Hemmerling:
1-Pointer Automata Searching Finite Plane Graphs. Math. Log. Q. 32(13-16): 245-256 (1986) - [c3]Armin Hemmerling:
Remark on the Power of Compass (Extended Abstract). MFCS 1986: 405-413 - 1984
- [j11]Armin Hemmerling:
A searching algorithm for finite embedded D-graphs with no more than k regions. Bull. EATCS 24: 78-84 (1984) - [j10]Armin Hemmerling, Gerd Murawski:
Zur Raumkompliziertheit mehrdimensionaler Turing-Automaten. Math. Log. Q. 30(13-16): 233-258 (1984) - [c2]Armin Hemmerling, Klaus Kriegel:
On Searching of Special Cases of Mazes and Finite Embedded Graphs. MFCS 1984: 291-300 - 1983
- [j9]Armin Hemmerling:
D!=ND für mehrdimensionale Turing-Automaten mit sublogarithmischer Raumschranke. J. Inf. Process. Cybern. 19(1/2): 85-94 (1983) - 1982
- [j8]Armin Hemmerling:
On the Computational Equivalence of Synchronous and Asynchronous Cellular Spaces. J. Inf. Process. Cybern. 18(7/8): 423-434 (1982)
1970 – 1979
- 1979
- [b1]Armin Hemmerling:
Turing-Automaten, Systeme von Turing-Automaten und Zellularräume in mehrdimensionalen Speichermedien. University of Greifswald, Germany, 1979 - [j7]Armin Hemmerling:
Systeme von Turing-Automaten und Zellularräume auf rahmbaren Pseudomustermengen. J. Inf. Process. Cybern. 15(1/2): 47-72 (1979) - [j6]Armin Hemmerling:
Zur Raumkompliziertheit mehrdimensionaler Zellularräume und Turing-Automaten. J. Inf. Process. Cybern. 15(3): 143-158 (1979) - [c1]Armin Hemmerling:
Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces. FCT 1979: 167-174 - 1978
- [j5]Armin Hemmerling:
Realisierung der Verbandsopteratioen für Regulartiätsklassen von Kodierungen. J. Inf. Process. Cybern. 14(3): 145-152 (1978) - 1977
- [j4]Armin Hemmerling:
Vergleich einiger Kodierungen der natürlichen Zahlen bezüglich der regulären Entscheidbarkeit von Zahlenmengen. J. Inf. Process. Cybern. 13(4/5): 217-230 (1977) - [j3]Armin Hemmerling:
Allgemeine Untersuchungen zur Entscheidbarkeit und Trennbarkeit bezüglich Kodierungen. J. Inf. Process. Cybern. 13(6): 295-309 (1977) - [j2]Armin Hemmerling:
Zur verallgemeinerten Realisierbarkeit von Pseudomusterfunktionen durch Zellularräume. J. Inf. Process. Cybern. 13(10): 523-528 (1977) - 1976
- [j1]Armin Hemmerling:
Turing-Maschinen und Zellularräume in der Ebene. J. Inf. Process. Cybern. 12(8/9): 379-402 (1976)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
