| 2008 |
|---|
| 23 | 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 |
| 22 | 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) |
| 21 | EE | Uwe Naumann,
Yuxiao Hu:
Optimal vertex elimination in single-expression-use graphs.
ACM Trans. Math. Softw. 35(1): (2008) |
| 20 | EE | Uwe Naumann:
Optimal Jacobian accumulation is NP-complete.
Math. Program. 112(2): 427-441 (2008) |
| 19 | EE | Laurent Hascoët,
Jean Utke,
Uwe Naumann:
Cheaper adjoints by reversing address computations.
Scientific Programming 16(1): 81-92 (2008) |
| 2007 |
|---|
| 18 | | Ebadollah Varnik,
Uwe Naumann:
Parallel Jacobian Accumulation.
PARCO 2007: 311-318 |
| 17 | EE | Uwe Naumann,
Jan Riehme:
On Syntax-Directed Adjoint Fortran Code.
Comput. Sci. Inf. Syst. 4(2): 47-64 (2007) |
| 2006 |
|---|
| 16 | EE | Uwe Naumann,
Andre Vehreschild:
Tangent-Linear Models by Augmented LL-Parsers.
ICCSA (1) 2006: 865-874 |
| 15 | 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 |
|---|
| 14 | 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 |
| 13 | EE | Uwe Naumann,
Jan Riehme:
A differentiation-enabled fortran 95 compiler.
ACM Trans. Math. Softw. 31(4): 458-474 (2005) |
| 12 | EE | Laurent Hascoët,
Uwe Naumann,
Valérie Pascual:
"To be recorded" analysis in reverse-mode automatic differentiation.
Future Generation Comp. Syst. 21(8): 1401-1417 (2005) |
| 2004 |
|---|
| 11 | | 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 |
| 10 | EE | Uwe Naumann,
Jean Utke,
Andrew Lyons,
Michael Fagan:
Control Flow Reversal for Adjoint Code Generation.
SCAM 2004: 55-64 |
| 9 | EE | Uwe Naumann:
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph.
Math. Program. 99(3): 399-421 (2004) |
| 2003 |
|---|
| 8 | EE | Uwe Naumann,
Patrick Heimbach:
Coupling Tangent-Linear and Adjoint Models.
ICCSA (2) 2003: 105-114 |
| 7 | EE | Andreas Alexander Albrecht,
Peter Gottschling,
Uwe Naumann:
Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently.
International Conference on Computational Science 2003: 575-584 |
| 6 | | Malcolm Cohen,
Uwe Naumann,
Jan Riehme:
Towards Differentiation-Enabled FORTRAN 95 Compiler Technology.
SAC 2003: 143-147 |
| 5 | EE | Uwe Naumann,
Peter Gottschling:
Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation.
SAGA 2003: 83-97 |
| 4 | EE | Uwe Naumann,
Andrea Walther:
An Introduction to Using Software Tools for Automatic Differentiation
CoRR cs.MS/0310057: (2003) |
| 3 | EE | Andreas Griewank,
Uwe Naumann:
Accumulating Jacobians as chained sparse matrix products.
Math. Program. 95(3): 555-571 (2003) |
| 2002 |
|---|
| 2 | EE | Uwe Naumann:
Reducing the Memory Requirement in Reverse Mode Automatic Differentiation by Solving TBR Flow Equations.
International Conference on Computational Science (2) 2002: 1039-1048 |
| 2001 |
|---|
| 1 | EE | Uwe Naumann,
Peter Gottschling:
Prospects for Simulated Annealing Algorithms in Automatic Differentiation.
SAGA 2001: 131-144 |
