default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmin Kühnemann
Person information
- affiliation: Dresden University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j6]Jürgen Giesl
, Armin Kühnemann, Janis Voigtländer:
Deaccumulation techniques for improving provability. J. Log. Algebraic Methods Program. 71(2): 79-113 (2007)- 2006
- [c7]Armin Kühnemann, Andreas Maletti:
The Substitution Vanishes. AMAST 2006: 173-188 - 2005
- [j5]Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. 347(1-2): 276-287 (2005) - 2004
- [j4]Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. 91(2): 57-67 (2004) - [j3]Janis Voigtländer, Armin Kühnemann:
Composition of functions with accumulating parameters. J. Funct. Program. 14(3): 317-363 (2004) - 2003
- [c6]Jürgen Giesl, Armin Kühnemann, Janis Voigtländer:
Deaccumulation - Improving Provability. ASIAN 2003: 146-160 - 2001
- [b2]Armin Kühnemann:
Attribute grammars and program optimization - summer colloquium Waseda University, Tokyo, Japan, July 25 - August 2, 2000. Waseda University 2001, pp. 1-64 - [c5]Armin Kühnemann, Robert Glück, Kazuhiko Kakehi:
Relating Accumulative and Non-accumulative Functional Programs. RTA 2001: 154-168
1990 – 1999
- 1999
- [c4]Armin Kühnemann:
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers. Fuji International Symposium on Functional and Logic Programming 1999: 114-130 - 1998
- [c3]Armin Kühnemann:
Benefits of Tree Transducers for Optimizing Functional Programs. FSTTCS 1998: 146-157 - 1997
- [b1]Armin Kühnemann:
Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata. Dresden University of Technology, Shaker 1997, ISBN 3-8265-2879-4, pp. 1-180 - [c2]Armin Kühnemann:
A Two-Dimensional Hierarchy for Attributed Tree Transducers. FCT 1997: 281-292 - 1996
- [c1]Armin Kühnemann:
A Pumping Lemma for Output Languages of Macro Tree Transducers. CAAP 1996: 44-58 - 1994
- [j2]Armin Kühnemann, Heiko Vogler:
Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic. Acta Informatica 31(5): 431-477 (1994) - [j1]Armin Kühnemann, Heiko Vogler:
A Pumping Lemma for Output Languages of Attributed Tree Transducers. Acta Cybern. 11(4): 261-305 (1994)
Coauthor Index
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-10-07 22:16 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:
