| Publication | Date of Publication | Type |
|---|
| On sparse matrix chain products | 2024-05-15 | Paper |
| A matrix-free exact Newton method | 2024-05-07 | Paper |
| Subdomain separability in global optimization | 2023-07-13 | Paper |
| Numerical simulation of differential-algebraic equations with embedded global optimization criteria | 2023-05-09 | Paper |
| A Matrix-Free Newton Method | 2023-05-02 | Paper |
| Hessian chain bracketing | 2023-04-19 | Paper |
| Seven open problems in applied combinatorics | 2023-03-20 | Paper |
| Elimination Techniques for Algorithmic Differentiation Revisited | 2023-03-20 | Paper |
| Discrete Adjoint Approaches for CHT Applications in OpenFOAM | 2022-09-01 | Paper |
| Algorithmic differentiation of hyperbolic flow problems | 2022-04-11 | Paper |
| Numerical Stability of Tangents and Adjoints of Implicit Functions | 2021-06-16 | Paper |
| Hessian Chain Bracketing | 2021-03-17 | Paper |
| Differential Invariants | 2021-01-09 | Paper |
| Algorithmic differentiation of hyperbolic flow problems | 2020-07-10 | Paper |
| Adjoint Code Design Patterns | 2020-04-24 | Paper |
| Optimization of Generalized Jacobian Chain Products without Memory Constraints | 2020-03-12 | Paper |
| SIMPLE adjoint message passing | 2018-10-09 | Paper |
| On lower bounds for optimal Jacobian accumulation | 2018-10-09 | Paper |
| Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures | 2018-07-18 | Paper |
| Algorithmic differentiation of numerical methods: tangent and adjoint solvers for parameterized systems of nonlinear equations | 2016-10-24 | Paper |
| GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging | 2015-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2844230 | 2013-08-28 | Paper |
| Adjoint Mode Computation of Subgradients for McCormick Relaxations | 2012-09-26 | Paper |
| Hierarchical Algorithmic Differentiation A Case Study | 2012-09-26 | Paper |
| On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs | 2012-05-23 | Paper |
| The Art of Differentiating Computer Programs | 2012-03-19 | Paper |
| DAG reversal is NP-complete | 2009-12-10 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2009-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601079 | 2009-02-09 | Paper |
| Tangent-Linear Models by Augmented LL-Parsers | 2009-01-27 | Paper |
| OpenAD/F | 2008-12-21 | Paper |
| Structure-exploiting automatic differentiation of finite element discretizations | 2008-10-17 | Paper |
| Call tree reversal is NP-complete | 2008-10-17 | Paper |
| Adjoints for time-dependent optimal control | 2008-10-17 | Paper |
| Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently | 2008-09-30 | Paper |
| A differentiation-enabled Fortran 95 compiler | 2008-06-18 | Paper |
| Optimal Jacobian accumulation is NP-complete | 2008-01-07 | Paper |
| Optimality-preserving elimination of linearities in Jacobian accumulation | 2007-03-16 | Paper |
| Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph | 2004-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737840 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739607 | 2004-08-06 | Paper |
| Accumulating Jacobians as chained sparse matrix products | 2003-07-13 | Paper |
| Cheaper Jacobians by Simulated Annealing | 2003-01-05 | Paper |
| An enhanced Markowitz rule for accumulating Jacobian matrices efficiently | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4236314 | 1999-03-26 | Paper |
| A Note on Adjoint Linear Algebra | N/A | Paper |
