Abstract is missing.
- Front Matter [doi]
- Low-Memory Algorithmic Adjoint PropagationUwe Naumann, Klaus Leppkes. 1-10 [doi]
- On spectral partitioning of signed graphsAndrew Knyazev. 11-22 [doi]
- Fault Tolerant Resource Efficient Matrix MultiplicationNoam Birnbaum, Oded Schwartz. 23-34 [doi]
- Evolving Difficult Graphs for Laplacian SolversKevin Deweese, John R. Gilbert. 35-44 [doi]
- Index Reduction for Differential-Algebraic Equations with Mixed MatricesSatoru Iwata 0001, Taihei Oki, Mizuyo Takamatsu. 45-55 [doi]
- Approximation algorithms for maximum matchings in undirected graphsFanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar. 56-65 [doi]
- Multi-criteria Graph Partitioning with ScotchRémi Barat, Cédric Chevalier, François Pellegrini. 66-75 [doi]
- Fast and effective reordering of columns within supernodes using partition refinementMathias Jacquelin, Esmond G. Ng, Barry W. Peyton. 76-86 [doi]
- Highly scalable distributed-memory sparse triangular solution algorithmsYang Liu, Mathias Jacquelin, Pieter Ghysels, Xiaoye S. Li. 87-96 [doi]
- New Approximation Algorithms for Minimum Weighted Edge CoverS. M. Ferdous, Alex Pothen, Arif Khan. 97-108 [doi]