default search action
Dagstuhl Seminar Proceedings: Combinatorial Scientific Computing 2009
- Uwe Naumann, Olaf Schenk, Horst D. Simon, Sivan Toledo:
Combinatorial Scientific Computing, 01.02. - 06.02.2009. Dagstuhl Seminar Proceedings 09061, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 - Uwe Naumann, Olaf Schenk, Horst D. Simon, Sivan Toledo:
09061 Abstracts Collection - Combinatorial Scientific Computing. - Cevdet Aykanat, Erkan Okuyan, Berkant Barla Cambazoglu:
A Model for Task Repartioning under Data Replication. - Samuel I. Daitch, Daniel A. Spielman:
A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix. - Jan Riehme, Andreas Griewank:
Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO). - H. Martin Bücker, Michael Lülfesmann, Arno Rasch:
Assessing an approximation algorithm for the minimum fill-in problem in practice. - Rob H. Bisseling, Tristan van Leeuwen, Ümit V. Çatalyürek:
Combinatorial Problems in High-Performance Computing: Partitioning. - Jean Utke, Uwe Naumann:
Combinatorial Problems in OpenAD. - Iain S. Duff, Bora Uçar:
Combinatorial problems in solving linear systems. - François Pellegrini:
Distillating knowledge about SCOTCH. - Andrea Walther:
Getting Started with ADOL-C. - Karen D. Devine, Erik G. Boman, Lee Ann Riesen, Ümit V. Çatalyürek, Cédric Chevalier:
Getting Started with Zoltan: A Short Tutorial. - Viktor Mosenkis, Uwe Naumann, Elmar Peise:
Low-Memory Tour Reversal in Directed Graphs. - Timothy A. Davis:
Multifrontral multithreaded rank-revealing sparse QR factorization. - Doruk Bozdag, Catalin C. Barbacioru, Ümit V. Çatalyürek:
Parallelization of Mapping Algorithms for Next Generation Sequencing Applications. - Andrew Lyons, Ilya Safro:
Randomized Heuristics for Exploiting Jacobian Scarcity. - Andreas Wächter:
Short Tutorial: Getting Started With Ipopt in 90 Minutes. - Frank Hülsemann:
Stabilising aggregation AMG. - Shahadat Hossain, Trond Steihaug:
The CPR Method and Beyond : Prologue. - Assefaw Hadish Gebremedhin:
The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing. - Ruud van der Pas:
The Past, Present and Future of High Performance Computing. - Cédric Chevalier, Ilya Safro:
Weighted aggregation for multi-level graph partitioning.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.