@InProceedings{naumann_et_al:DagSemProc.09061.1,
author = {Naumann, Uwe and Schenk, Olaf and Simon, Horst D and Toledo, Sivan},
title = {{09061 Abstracts Collection – Combinatorial Scientific Computing}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--49},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.1},
URN = {urn:nbn:de:0030-drops-21124},
doi = {10.4230/DagSemProc.09061.1},
annote = {Keywords: Graphs, combinatorics, high-performance scientific computing}
}
@InProceedings{aykanat_et_al:DagSemProc.09061.2,
author = {Aykanat, Cevdet and Okuyan, Erkan and Cambazoglu, B. Barla},
title = {{A Model for Task Repartioning under Data Replication}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.2},
URN = {urn:nbn:de:0030-drops-20903},
doi = {10.4230/DagSemProc.09061.2},
annote = {Keywords: Task repartitioning, data replication, hypergraph partitioning with fixed vertices, assignment flow network}
}
@InProceedings{daitch_et_al:DagSemProc.09061.3,
author = {Daitch, Samuel I. and Spielman, Daniel A.},
title = {{A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.3},
URN = {urn:nbn:de:0030-drops-20803},
doi = {10.4230/DagSemProc.09061.3},
annote = {Keywords: M-matrix, diagonally-dominant matrix, linear system solver, iterative algorithm, randomized algorithm, network flow, gain graph}
}
@InProceedings{riehme_et_al:DagSemProc.09061.4,
author = {Riehme, Jan and Griewank, Andreas},
title = {{Algorithmic Differentiation Through Automatic Graph Elimination Ordering (ADTAGEO)}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.4},
URN = {urn:nbn:de:0030-drops-20852},
doi = {10.4230/DagSemProc.09061.4},
annote = {Keywords: Automatic Differentiation, Instant Elimination, Live-DAG, symmetric Hessian-DAG, forward mode, reverse mode, checkpointing, ADTAGEO}
}
@InProceedings{bucker_et_al:DagSemProc.09061.5,
author = {B\"{u}cker, H. Martin and L\"{u}lfesmann, Michael and Rasch, Arno},
title = {{Assessing an approximation algorithm for the minimum fill-in problem in practice}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--1},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.5},
URN = {urn:nbn:de:0030-drops-21191},
doi = {10.4230/DagSemProc.09061.5},
annote = {Keywords: Sparse linear algebra}
}
@InProceedings{bisseling_et_al:DagSemProc.09061.6,
author = {Bisseling, Rob and van Leeuwen, Tristan and Catalyurek, Umit V.},
title = {{Combinatorial Problems in High-Performance Computing: Partitioning}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--5},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.6},
URN = {urn:nbn:de:0030-drops-20818},
doi = {10.4230/DagSemProc.09061.6},
annote = {Keywords: Partitioning, sparse matrix, hypergraph, parallel, HPC}
}
@InProceedings{utke_et_al:DagSemProc.09061.7,
author = {Utke, Jean and Naumann, Uwe},
title = {{Combinatorial Problems in OpenAD}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.7},
URN = {urn:nbn:de:0030-drops-20954},
doi = {10.4230/DagSemProc.09061.7},
annote = {Keywords: Automatic differentiation, combinatorial problem, tool tutorial}
}
@InProceedings{duff_et_al:DagSemProc.09061.8,
author = {Duff, Iain S. and Ucar, Bora},
title = {{Combinatorial problems in solving linear systems}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--37},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.8},
URN = {urn:nbn:de:0030-drops-20779},
doi = {10.4230/DagSemProc.09061.8},
annote = {Keywords: Combinatorial scientific computing, graph theory, combinatorial optimization, sparse matrices, linear system solution}
}
@InProceedings{pellegrini:DagSemProc.09061.9,
author = {Pellegrini, Francois},
title = {{Distillating knowledge about SCOTCH}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.9},
URN = {urn:nbn:de:0030-drops-20914},
doi = {10.4230/DagSemProc.09061.9},
annote = {Keywords: Scotch, graph algorithms, data structures}
}
@InProceedings{walther:DagSemProc.09061.10,
author = {Walther, Andrea},
title = {{Getting Started with ADOL-C}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--10},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.10},
URN = {urn:nbn:de:0030-drops-20849},
doi = {10.4230/DagSemProc.09061.10},
annote = {Keywords: ADOL-C, algorithmic differentiation of C/C++ programs}
}
@InProceedings{devine_et_al:DagSemProc.09061.11,
author = {Devine, Karen D. and Boman, Erik G. and Riesen, Lee Ann and Catalyurek, Umit V. and Chevalier, C\'{e}dric},
title = {{Getting Started with Zoltan: A Short Tutorial}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--10},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.11},
URN = {urn:nbn:de:0030-drops-20886},
doi = {10.4230/DagSemProc.09061.11},
annote = {Keywords: Parallel computing, load balancing, partitioning, coloring, ordering, software}
}
@InProceedings{mosenkis_et_al:DagSemProc.09061.12,
author = {Mosenkis, Viktor and Naumann, Uwe and Peise, Elmar},
title = {{Low-Memory Tour Reversal in Directed Graphs}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.12},
URN = {urn:nbn:de:0030-drops-20924},
doi = {10.4230/DagSemProc.09061.12},
annote = {Keywords: Directed graph, tour reversal, offline algorithm, dynamic programming, online algorithm, control-flow reversal, adjoint program}
}
@InProceedings{davis:DagSemProc.09061.13,
author = {Davis, Timothy},
title = {{Multifrontral multithreaded rank-revealing sparse QR factorization}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.13},
URN = {urn:nbn:de:0030-drops-20781},
doi = {10.4230/DagSemProc.09061.13},
annote = {Keywords: Sparse matrix algorithms, QR factorization, multifrontal}
}
@InProceedings{bozdag_et_al:DagSemProc.09061.14,
author = {Bozdag, Doruk and Barbacioru, Catalin C. and Catalyurek, Umit V.},
title = {{Parallelization of Mapping Algorithms for Next Generation Sequencing Applications}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--1},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.14},
URN = {urn:nbn:de:0030-drops-21294},
doi = {10.4230/DagSemProc.09061.14},
annote = {Keywords: Genome sequencing, sequence mapping}
}
@InProceedings{lyons_et_al:DagSemProc.09061.15,
author = {Lyons, Andrew and Safro, Ilya},
title = {{Randomized Heuristics for Exploiting Jacobian Scarcity}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.15},
URN = {urn:nbn:de:0030-drops-20868},
doi = {10.4230/DagSemProc.09061.15},
annote = {Keywords: Jacobian, scarcity, accumulation, directed acyclic graph}
}
@InProceedings{wachter:DagSemProc.09061.16,
author = {W\"{a}chter, Andreas},
title = {{Short Tutorial: Getting Started With Ipopt in 90 Minutes}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--17},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.16},
URN = {urn:nbn:de:0030-drops-20890},
doi = {10.4230/DagSemProc.09061.16},
annote = {Keywords: Nonlinear Optimization, Tutorial, Ipopt, COIN-OR}
}
@InProceedings{hulsemann:DagSemProc.09061.17,
author = {H\"{u}lsemann, Frank},
title = {{Stabilising aggregation AMG}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.17},
URN = {urn:nbn:de:0030-drops-20946},
doi = {10.4230/DagSemProc.09061.17},
annote = {Keywords: Algebraic multigrid, aggregation, stabilisation}
}
@InProceedings{hossain_et_al:DagSemProc.09061.18,
author = {Hossain, Shahadat and Steihaug, Trond},
title = {{The CPR Method and Beyond : Prologue}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.18},
URN = {urn:nbn:de:0030-drops-20797},
doi = {10.4230/DagSemProc.09061.18},
annote = {Keywords: Structural Orthogonality, Optimal CPR, Sparse Jacobian Estimation Software}
}
@InProceedings{gebremedhin:DagSemProc.09061.19,
author = {Gebremedhin, Assefaw H.},
title = {{The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.19},
URN = {urn:nbn:de:0030-drops-20934},
doi = {10.4230/DagSemProc.09061.19},
annote = {Keywords: Graph coloring, sparse derivative computation, automatic differentiation, parallel computing}
}
@InProceedings{vanderpas:DagSemProc.09061.20,
author = {van der Pas, Ruud},
title = {{The Past, Present and Future of High Performance Computing}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--7},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.20},
URN = {urn:nbn:de:0030-drops-20836},
doi = {10.4230/DagSemProc.09061.20},
annote = {Keywords: High-Performance Scientific Computing}
}
@InProceedings{chevalier_et_al:DagSemProc.09061.21,
author = {Chevalier, C\'{e}dric and Safro, Ilya},
title = {{Weighted aggregation for multi-level graph partitioning}},
booktitle = {Combinatorial Scientific Computing},
pages = {1--1},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9061},
editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.21},
URN = {urn:nbn:de:0030-drops-20820},
doi = {10.4230/DagSemProc.09061.21},
annote = {Keywords: Graph partitioning, multilevel, coarsening, weighted aggregation}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing