Search the dblp DataBase
Jean Utke :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Uwe Naumann , Jean Utke Source Templates for the Automatic Generation of Adjoint Code Through Static Call Graph Reversal. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (1), 2005, pp:338-346 [Conf ] Uwe Naumann , Jean Utke , Andrew Lyons , Michael Fagan Control Flow Reversal for Adjoint Code Generation. [Citation Graph (0, 0)][DBLP ] SCAM, 2004, pp:55-64 [Conf ] Michael Fagan , Laurent Hascoët , Jean Utke Data Representation Alternatives in Semantically Augmented Numerical Models. [Citation Graph (0, 0)][DBLP ] SCAM, 2006, pp:85-94 [Conf ] Paul D. Hovland , Boyana Norris , Michelle Mills Strout , Jean Utke Term Graphs for Computing Derivatives in Imperative Languages. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:176, n:1, pp:99-111 [Journal ] Jean Utke , Andrew Lyons , Uwe Naumann Efficient reversal of the intraprocedural flow of control in adjoint computations. [Citation Graph (0, 0)][DBLP ] Journal of Systems and Software, 2006, v:79, n:9, pp:1280-1294 [Journal ] Andreas Griewank , Jean Utke , Andrea Walther Evaluating higher derivative tensors by forward propagation of univariate Taylor series. [Citation Graph (0, 0)][DBLP ] Math. Comput., 2000, v:69, n:231, pp:1117-1130 [Journal ] Andreas Griewank , David W. Juedes , Jean Utke Algorithm 755: ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++. [Citation Graph (0, 0)][DBLP ] ACM Trans. Math. Softw., 1996, v:22, n:2, pp:131-167 [Journal ] Jean Utke , Uwe Naumann Separating language dependent and independent tasks for the semantic transformation of numerical programs. [Citation Graph (0, 0)][DBLP ] IASTED Conf. on Software Engineering and Applications, 2004, pp:552-558 [Conf ] Toward adjoinable MPI. [Citation Graph (, )][DBLP ] A Framework for Proving Correctness of Adjoint Message-Passing Programs. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs