Efficient calculation of Jacobian matrices by optimized application of the chain rule to computational graphs. - Uwe Naumann (1999)

Prospects for Simulated Annealing Algorithms in Automatic Differentiation. - Uwe Naumann; Peter Gottschling (SAGA, 2001)

Reducing the Memory Requirement in Reverse Mode Automatic Differentiation by Solving TBR Flow Equations. - Uwe Naumann (International Conference on Computational Science (2), 2002)

Cheaper Jacobians by Simulated Annealing. - Uwe Naumann (SIAM J. Optim., 2002)

Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently. - Andreas Alexander Albrecht; Peter Gottschling; Uwe Naumann (International Conference on Computational Science, 2003)

Coupling Tangent-Linear and Adjoint Models. - Uwe Naumann; Patrick Heimbach (ICCSA (2), 2003)

Towards Differentiation-Enabled FORTRAN 95 Compiler Technology. - Malcolm Cohen; Uwe Naumann; Jan Riehme (SAC, 2003)

Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation. - Uwe Naumann; Peter Gottschling (SAGA, 2003)

An Introduction to Using Software Tools for Automatic Differentiation - Uwe Naumann; Andrea Walther (CoRR, 2003)

Accumulating Jacobians as chained sparse matrix products. - Andreas Griewank; Uwe Naumann (Math. Program., 2003)

Separating language dependent and independent tasks for the semantic transformation of numerical programs. - Jean Utke; Uwe Naumann (IASTED Conf. on Software Engineering and Applications, 2004)

Control Flow Reversal for Adjoint Code Generation. - Uwe Naumann; Jean Utke; Andrew Lyons; Michael W. Fagan (SCAM, 2004)

Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph. - Uwe Naumann (Math. Program., 2004)

Source Templates for the Automatic Generation of Adjoint Code Through Static Call Graph Reversal. - Uwe Naumann; Jean Utke (International Conference on Computational Science (1), 2005)

"To be recorded" analysis in reverse-mode automatic differentiation. - Laurent Hascoët; Uwe Naumann; Valérie Pascual (Future Gener. Comput. Syst., 2005)

A differentiation-enabled fortran 95 compiler. - Uwe Naumann; Jan Riehme (ACM Trans. Math. Softw., 2005)

Tangent-Linear Models by Augmented LL-Parsers. - Uwe Naumann; Andre Vehreschild (ICCSA (1), 2006)

Efficient reversal of the intraprocedural flow of control in adjoint computations. - Jean Utke; Andrew Lyons; Uwe Naumann (J. Syst. Softw., 2006)

Parallel Jacobian Accumulation. - Ebadollah Varnik; Uwe Naumann (PARCO, 2007)

On syntax-directed adjoint fortran code. - Uwe Naumann; Jan Riehme (Comput. Sci. Inf. Syst., 2007)

A Framework for Proving Correctness of Adjoint Message-Passing Programs. - Uwe Naumann; Laurent Hascoët; Chris Hill; Paul D. Hovland; Jan Riehme; Jean Utke (PVM/MPI, 2008)

Optimal Jacobian accumulation is NP-complete. - Uwe Naumann (Math. Program., 2008)

Cheaper adjoints by reversing address computations. - Laurent Hascoët; Jean Utke; Uwe Naumann (Sci. Program., 2008)

Optimal vertex elimination in single-expression-use graphs. - Uwe Naumann; Yuxiao Hu (ACM Trans. Math. Softw., 2008)

OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes. - Jean Utke; Uwe Naumann; Michael W. Fagan; Nathan R. Tallent; Michelle Mills Strout; Patrick Heimbach; Chris Hill; Carl Wunsch (ACM Trans. Math. Softw., 2008)

Low-Memory Tour Reversal in Directed Graphs. - Viktor Mosenkis; Uwe Naumann; Elmar Peise (Combinatorial Scientific Computing, 2009)

09061 Abstracts Collection - Combinatorial Scientific Computing. - Uwe Naumann; Olaf Schenk; Horst D. Simon; Sivan Toledo (Combinatorial Scientific Computing, 2009)

Combinatorial Problems in OpenAD. - Jean Utke; Uwe Naumann (Combinatorial Scientific Computing, 2009)

Toward adjoinable MPI. - Jean Utke; Laurent Hascoët; Patrick Heimbach; Chris Hill; Paul D. Hovland; Uwe Naumann (IPDPS, 2009)

DAG reversal is NP-complete. - Uwe Naumann (J. Discrete Algorithms, 2009)

Second-Order Algorithmic Differentiation by Source Transformation of MPI Code. - Michel Schanen; Michael Förster; Uwe Naumann (EuroMPI, 2010)

Discrete first- and second-order adjoints and automatic differentiation for the sensitivity analysis of dynamic models. - Ralf Hannemann; Wolfgang Marquardt; Uwe Naumann; Boris Gendler (ICCS, 2010)

On the use of discrete adjoints in goal error estimation for shallow water equations. - Florian Rauser; Jan Riehme; Klaus Leppkes; Peter Korn; Uwe Naumann (ICCS, 2010)

Interpretative adjoints for numerical simulation codes using MPI. - Michel Schanen; Uwe Naumann; Laurent Hascoët; Jean Utke (ICCS, 2010)

Optimization and Evaluation of a Multimedia Streaming Service on Hybrid Telco cloud - Trong Duong Quoc; Heiko Perkuhn; Daniel Catrein; Uwe Naumann; Toni Anwar (CoRR, 2011)

The Art of Differentiating Computer Programs - An Introduction to Algorithmic Differentiation. - Uwe Naumann (SIAM, 2012)

A Wish List for Efficient Adjoints of One-Sided MPI Communication. - Michel Schanen; Uwe Naumann (EuroMPI, 2012)

Preface. - Bruce Christianson; Uwe Naumann; Jean Utke; Andrea Walther (Optim. Methods Softw., 2012)

On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs. - Viktor Mosenkis; Uwe Naumann (Optim. Methods Softw., 2012)

Software for Higher-order Sensitivity Analysis of Parametric DAEs. - Moritz Schmitz; Ralf Hannemann-Tamás; Boris Gendler; Michael Förster; Wolfgang Marquardt; Uwe Naumann (Simul. Notes Eur., 2012)

Solving a Least-Squares Problem with Algorithmic Differentiation and OpenMP. - Michael Förster; Uwe Naumann (Euro-Par, 2013)

Discrete Adjoints of PETSc through dco/c++ and Adjoint MPI. - Johannes Lotz 001; Uwe Naumann; Max Sagebaum; Michel Schanen (Euro-Par, 2013)

Algorithmic Differentiation of a Complex C++ Code with Underlying Libraries. - Max Sagebaum; Nicolas R. Gauger; Uwe Naumann; Johannes Lotz 001; Klaus Leppkes (ICCS, 2013)

A Discrete Adjoint Model for OpenFOAM. - Markus Towara; Uwe Naumann (ICCS, 2013)

Towards tangent-linear GPU programs using OpenACC. - Bui Tat Minh; Michael Förster; Uwe Naumann (SoICT, 2013)

Fast and accurate parameter sensitivities for the general rate model of column liquid chromatography. - Andreas Püttmann; Sebastian Schnittert; Uwe Naumann; Eric von Lieres (Comput. Chem. Eng., 2013)

Energy Efficiency through Significance-Based Computing. - Dimitrios S. Nikolopoulos; Hans Vandierendonck; Nikolaos Bellas; Christos D. Antonopoulos; Spyros Lalis; Georgios Karakonstantis; Andreas Burg 001; Uwe Naumann (Computer, 2014)

Adjoint Methods in Computational Science, Engineering, and Finance (Dagstuhl Seminar 14371). - Nicolas R. Gauger; Michael B. Giles; Max D. Gunzburger; Uwe Naumann (Dagstuhl Reports, 2014)

Higher-order Discrete Adjoint ODE Solver in C++ for Dynamic Optimization. - Johannes Lotz 001; Uwe Naumann; Ralf Hannemann-Tamás; Tobias Ploch; Alexander Mitsos (ICCS, 2015)

Second-order Tangent Solvers for Systems of Parameterized Nonlinear Equations. - Niloofar Safiran; Johannes Lotz 001; Uwe Naumann (ICCS, 2015)

MPI-Parallel Discrete Adjoint OpenFOAM. - Markus Towara; Michel Schanen; Uwe Naumann (ICCS, 2015)

Automation of Significance Analyses with Interval Splitting. - Jens Deussen; Jan Riehme; Uwe Naumann (PARCO, 2015)

The IceProd framework: Distributed data processing for the IceCube neutrino observatory. - Mark G. Aartsen; Rasha U. Abbasi; Markus Ackermann 003; Jenni Adams; Juan Antonio Aguilar Sánchez; Markus Ahlers; David Altmann; Carlos A. Argüelles Delgado; Jan Auffenberg; Xinhua Bai; Michael F. Baker; Steven W. Barwick; et al. (J. Parallel Distributed Comput., 2015)

GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging. - Felix Gremse; Andreas Höfter; Lars Ole Schwen; Fabian Kiessling; Uwe Naumann (SIAM J. Sci. Comput., 2015)

Algorithmic Differentiation of Numerical Methods: Tangent and Adjoint Solvers for Parameterized Systems of Nonlinear Equations. - Uwe Naumann; Johannes Lotz 001; Klaus Leppkes; Markus Towara (ACM Trans. Math. Softw., 2015)

Towards automatic significance analysis for approximate computing. - Vassilis Vassiliadis; Jan Riehme; Jens Deussen; Konstantinos Parasyris; Christos D. Antonopoulos; Nikolaos Bellas; Spyros Lalis; Uwe Naumann (CGO, 2016)

A Case Study in Adjoint Sensitivity Analysis of Parameter Calibration. - Johannes Lotz 001; Marc Schwalbach; Uwe Naumann (ICCS, 2016)

Algorithmic Differentiation of Numerical Methods: Second-Order Adjoint Solvers for Parameterized Systems of Nonlinear Equations. - Niloofar Safiran; Johannes Lotz 001; Uwe Naumann (ICCS, 2016)

Mixed Integer Programming for Call Tree Reversal. - Johannes Lotz 001; Uwe Naumann; Sumit Mitra (CSC, 2016)

GPU-accelerated adjoint algorithmic differentiation. - Felix Gremse; Andreas Höfter; Lukas Razik; Fabian Kiessling; Uwe Naumann (Comput. Phys. Commun., 2016)

First-order uncertainty analysis using Algorithmic Differentiation of morphodynamic models. - Catherine Villaret; Rebekka Kopmann; David Wyncoll; Jan Riehme; Uwe Merkel; Uwe Naumann (Comput. Geosci., 2016)

Low-Memory Algorithmic Adjoint Propagation. - Uwe Naumann; Klaus Leppkes (CSC, 2018)

On lower bounds for optimal Jacobian accumulation. - Viktor Mosenkis; Uwe Naumann (Optim. Methods Softw., 2018)

SIMPLE adjoint message passing. - Markus Towara; Uwe Naumann (Optim. Methods Softw., 2018)

Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures. - Felix Gremse; Kerstin Küpper; Uwe Naumann (SIAM J. Sci. Comput., 2018)

Efficient Computation of Sparse Higher Derivative Tensors. - Jens Deussen; Uwe Naumann (ICCS (1), 2019)

Toward Global Search for Local Optima. - Jens Deussen; Jonathan J. Hüser; Uwe Naumann (OR, 2019)

Discrete Interval Adjoints in Unconstrained Global Optimization. - Jens Deussen; Uwe Naumann (WCGO, 2019)

Adjoint Code Design Patterns. - Uwe Naumann (ACM Trans. Math. Softw., 2019)

Interval Adjoint Significance Analysis for Neural Networks. - Sher Afghan; Uwe Naumann (ICCS (3), 2020)

Patient-Specific Cardiac Parametrization from Eikonal Simulations. - Daniel Ganellari; Gundolf Haase; Gerhard W. Zumbusch; Johannes Lotz 001; Patrick Peltzer; Klaus Leppkes; Uwe Naumann (ICCS (1), 2020)

MCMC for Bayesian Uncertainty Quantification from Time-Series Data. - Philip Maybank; Patrick Peltzer; Uwe Naumann; Ingo Bojak (ICCS (7), 2020)

Eigen-AD: Algorithmic Differentiation of the Eigen Library. - Patrick Peltzer; Johannes Lotz 001; Uwe Naumann (ICCS (1), 2020)

On Sparse Matrix Chain Products. - Uwe Naumann (CSC, 2020)

Optimization of Generalized Jacobian Chain Products without Memory Constraints. - Uwe Naumann (CoRR, 2020)

Differential Invariants. - Uwe Naumann (CoRR, 2021)

A Dynamic Programming Heuristic for Dense Hessian Chain Bracketing. - Uwe Naumann; Shubhaditya Burela (CoRR, 2021)

On the Computational Complexity of the Chain Rule of Differential Calculus. - Uwe Naumann (CoRR, 2021)

Differentiable Scripting. - Uwe Naumann (CoRR, 2021)

Algorithmic differentiation of hyperbolic flow problems. - Michael Herty; Jonathan J. Hüser; Uwe Naumann; Thomas Schilden; Wolfgang Schröder 001 (J. Comput. Phys., 2021)

A Note on Adjoint Linear Algebra. - Uwe Naumann (ICCS (1), 2022)

Numerical Stability of Tangents and Adjoints of Implicit Functions. - Uwe Naumann (ICCS (3), 2022)

Direct single shooting for dynamic optimization of differential-algebraic equation systems with optimization criteria embedded. - Tobias Ploch; Jens Deussen; Uwe Naumann; Alexander Mitsos; Ralf Hannemann-Tamás (Comput. Chem. Eng., 2022)

Reduction of the Random Access Memory Size in Adjoint Algorithmic Differentiation by Overloading. - Uwe Naumann (CoRR, 2022)

Elimination Techniques for Algorithmic Differentiation Revisited. - Uwe Naumann; Erik Schneidereit; Simon Märtens; Markus Towara (ACDA, 2023)

Parallel Adjoint Taping Using MPI. - Markus Towara; Jannick Kremer; Uwe Naumann (ICCS (1), 2023)

Seven open problems in applied combinatorics. - Sinan G. Aksoy; Ryan S. Bennink; Yuzhou Chen; José Frías; Yulia R. Gel; Bill Kay; Uwe Naumann; Carlos Ortiz Marrero; Anthony V. Petyuk; Sandip Roy 002; Ignacio Segovia-Dominguez; Nate Veldt; et al. (CoRR, 2023)

A Matrix-Free Newton Method. - Uwe Naumann (CoRR, 2023)

Differentiable Programming: Efficient Smoothing of Control-Flow-Induced Discontinuities. - Sebastian Christodoulou; Uwe Naumann (CoRR, 2023)

Subdomain separability in global optimization. - Jens Deussen; Uwe Naumann (J. Glob. Optim., 2023)

Towards Sobolev Pruning. - Neil Kichler; Sher Afghan; Uwe Naumann (PASC, 2024)

Seasons's Greetings by AD. - Uwe Naumann (CoRR, 2024)

Matrix-Free Jacobian Chaining. - Uwe Naumann (CoRR, 2024)

Differential Inversion of the Implicit Euler Method: Symbolic Analysis. - Uwe Naumann (CoRR, 2024)

An Efficient Local Optimizer-Tracking Solver for Differential-Algebriac Equations with Optimization Criteria. - Alexander Fleming; Jens Deussen; Uwe Naumann (CoRR, 2024)

Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201). - Kathrin Hanauer; Uwe Naumann; Alex Pothen; Robert Schreiber (Dagstuhl Reports, 2024)

A Matrix-Free Exact Newton Method. - Uwe Naumann (SIAM J. Sci. Comput., 2024)

Differenzierbare Forschungssoftware. - Uwe Naumann (Softwaretechnik-Trends, 2024)

Scheduled Jacobian Chaining. - Simon Märtens; Uwe Naumann (CoRR, 2025)

Accelerating Deterministic Global Optimization via GPU-parallel Interval Arithmetic. - Hongzhen Zhang; Tim Kerkenhoff; Neil Kichler; Manuel Dahmen; Alexander Mitsos; Uwe Naumann; Dominik Bongartz (CoRR, 2025)