default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Armin Herrmann
Person information
- affiliation: University of Passau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2001
[b1]Christoph Armin Herrmann:
The skeleton based parallelization of divide and conquer recursions. University of Passau, Germany, Logos-Verlag 2001, ISBN 978-3-89722-556-5, pp. 1-251
Journal Articles
- 2006
- [j8]Albert Cohen, Sébastien Donadio, María Jesús Garzarán, Christoph Armin Herrmann, Oleg Kiselyov, David A. Padua:
In search of a program generator to implement generic transformations for high-performance computing. Sci. Comput. Program. 62(1): 25-46 (2006) - [j7]Christoph Armin Herrmann, Tobias Langhammer:
Combining partial evaluation and staged interpretation in the implementation of domain-specific languages. Sci. Comput. Program. 62(1): 47-65 (2006) - 2005
- [j6]Christoph A. Herrmann:
Generating Message-passing Programs from Abstract Specifications by Partial Evaluation. Parallel Process. Lett. 15(3): 305-320 (2005) - 2002
- [j5]Christoph A. Herrmann, Christian Lengauer:
Using Metaprogramming to Parallelize Functional Specifications. Parallel Process. Lett. 12(2): 193-210 (2002) - 2000
- [j4]Christoph A. Herrmann, Christian Lengauer:
HDC: A Higher-Order Language for Divide-and-Conquer. Parallel Process. Lett. 10(2/3): 239-250 (2000) - 1999
- [j3]Christoph A. Herrmann, Christian Lengauer:
Parallelization of Divide-and-Conquer by Translation to Nested Loops. J. Funct. Program. 9(3): 279-310 (1999) - 1997
- [j2]Christian Lengauer, Sergei Gorlatch, Christoph A. Herrmann:
The Static Parallelization of Loops and Recursions. J. Supercomput. 11(4): 333-353 (1997) - 1996
- [j1]Christoph Armin Herrmann, Christian Lengauer:
On the Space-Time Mapping of a Class of Divide-and-Conquer Recursions. Parallel Process. Lett. 6(4): 525-537 (1996)
Conference and Workshop Papers
- 2011
- [c6]Christoph A. Herrmann, Kevin Hammond
:
Counter Automata for Parameterised Timing Analysis of Box-Based Systems. FOPARA 2011: 126-141 - 2008
- [c5]Edwin C. Brady, Christoph A. Herrmann, Kevin Hammond:
Lightweight Invariants with Full Dependent Types. Trends in Functional Programming 2008: 161-177 - 2007
- [c4]Christoph A. Herrmann, Armelle Bonenfant, Kevin Hammond, Steffen Jost, Hans-Wolfgang Loidl, Robert F. Pointon:
Automatic Amortised Worst-Case Execution Time Analysis. WCET 2007 - 2001
- [c3]Christoph A. Herrmann, Christian Lengauer:
A Transformational Approach which Combines Size Inference and Program Optimization. SAIG 2001: 199-218 - 1999
- [c2]Christoph A. Herrmann, Jan Laitenberger, Christian Lengauer, Christian Schaller:
Static Parallelization of Functional Programs: Elimination of Higher-Order Functions & Optimized Inlining. Euro-Par 1999: 930-934 - 1997
- [c1]Christoph A. Herrmann, Christian Lengauer:
Transformation of Divide & Conquer to Nested Parallel Loops. PLILP 1997: 95-109
Parts in Books or Collections
- 2003
- [p1]Christoph A. Herrmann, Christian Lengauer:
Transforming Rapid Prototypes to Efficient Parallel Programs. Patterns and Skeletons for Parallel and Distributed Computing 2003: 65-94
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-04-24 23:13 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:
