Christoph A. Herrmann
List of publications from the
2007 |
11 | EE | Christoph A. Herrmann,
Armelle Bonenfant,
Kevin Hammond,
Steffen Jost,
Hans-Wolfgang Loidl,
Robert F. Pointon:
Automatic Amortised Worst-Case Execution Time Analysis.
WCET 2007 |
2006 |
10 | EE | 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) |
9 | EE | 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 |
8 | EE | Christoph A. Herrmann:
Generating Message-passing Programs from Abstract Specifications by Partial Evaluation.
Parallel Processing Letters 15(3): 305-320 (2005) |
2002 |
7 | EE | Christoph A. Herrmann,
Christian Lengauer:
Using Metaprogramming to Parallelize Functional Specifications.
Parallel Processing Letters 12(2): 193-210 (2002) |
2001 |
6 | EE | Christoph A. Herrmann,
Christian Lengauer:
A Transformational Approach which Combines Size Inference and Program Optimization.
SAIG 2001: 199-218 |
2000 |
5 | | Christoph A. Herrmann,
Christian Lengauer:
HDC: A Higher-Order Language for Divide-and-Conquer.
Parallel Processing Letters 10(2/3): 239-250 (2000) |
1999 |
4 | EE | 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 |
3 | | Christoph A. Herrmann,
Christian Lengauer:
Parallelization of Divide-and-Conquer by Translation to Nested Loops.
J. Funct. Program. 9(3): 279-310 (1999) |
1997 |
2 | | Christoph A. Herrmann,
Christian Lengauer:
Transformation of Divide & Conquer to Nested Parallel Loops.
PLILP 1997: 95-109 |
1 | EE | Christian Lengauer,
Sergei Gorlatch,
Christoph A. Herrmann:
The Static Parallelization of Loops and Recursions.
The Journal of Supercomputing 11(4): 333-353 (1997) |