2008 |
11 | EE | Uwe Naumann,
Laurent Hascoët,
Chris Hill,
Paul D. Hovland,
Jan Riehme,
Jean Utke:
A Framework for Proving Correctness of Adjoint Message-Passing Programs.
PVM/MPI 2008: 316-321 |
10 | EE | Jean Utke,
Uwe Naumann,
Michael Fagan,
Nathan R. Tallent,
Michelle Mills Strout,
Patrick Heimbach,
Chris Hill,
Carl Wunsch:
OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes.
ACM Trans. Math. Softw. 34(4): (2008) |
9 | EE | Laurent Hascoët,
Jean Utke,
Uwe Naumann:
Cheaper adjoints by reversing address computations.
Scientific Programming 16(1): 81-92 (2008) |
2007 |
8 | EE | Paul D. Hovland,
Boyana Norris,
Michelle Mills Strout,
Jean Utke:
Term Graphs for Computing Derivatives in Imperative Languages.
Electr. Notes Theor. Comput. Sci. 176(1): 99-111 (2007) |
2006 |
7 | EE | Michael Fagan,
Laurent Hascoët,
Jean Utke:
Data Representation Alternatives in Semantically Augmented Numerical Models.
SCAM 2006: 85-94 |
6 | EE | Jean Utke,
Andrew Lyons,
Uwe Naumann:
Efficient reversal of the intraprocedural flow of control in adjoint computations.
Journal of Systems and Software 79(9): 1280-1294 (2006) |
2005 |
5 | EE | Uwe Naumann,
Jean Utke:
Source Templates for the Automatic Generation of Adjoint Code Through Static Call Graph Reversal.
International Conference on Computational Science (1) 2005: 338-346 |
2004 |
4 | | Jean Utke,
Uwe Naumann:
Separating language dependent and independent tasks for the semantic transformation of numerical programs.
IASTED Conf. on Software Engineering and Applications 2004: 552-558 |
3 | EE | Uwe Naumann,
Jean Utke,
Andrew Lyons,
Michael Fagan:
Control Flow Reversal for Adjoint Code Generation.
SCAM 2004: 55-64 |
2000 |
2 | | Andreas Griewank,
Jean Utke,
Andrea Walther:
Evaluating higher derivative tensors by forward propagation of univariate Taylor series.
Math. Comput. 69(231): 1117-1130 (2000) |
1996 |
1 | EE | Andreas Griewank,
David W. Juedes,
Jean Utke:
Algorithm 755: ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++.
ACM Trans. Math. Softw. 22(2): 131-167 (1996) |