


default search action
8th CSC 2018: Bergen, Norway
- Fredrik Manne, Peter Sanders, Sivan Toledo:

Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, CSC 2018, Bergen, Norway, June 6-8, 2018. SIAM 2018, ISBN 978-1-61197-521-5 - Front Matter.

- Uwe Naumann, Klaus Leppkes:

Low-Memory Algorithmic Adjoint Propagation. 1-10 - Andrew Knyazev:

On spectral partitioning of signed graphs. 11-22 - Noam Birnbaum, Oded Schwartz:

Fault Tolerant Resource Efficient Matrix Multiplication. 23-34 - Kevin Deweese, John R. Gilbert:

Evolving Difficult Graphs for Laplacian Solvers. 35-44 - Satoru Iwata, Taihei Oki

, Mizuyo Takamatsu:
Index Reduction for Differential-Algebraic Equations with Mixed Matrices. 45-55 - Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:

Approximation algorithms for maximum matchings in undirected graphs. 56-65 - Rémi Barat, Cédric Chevalier, François Pellegrini

:
Multi-criteria Graph Partitioning with Scotch. 66-75 - Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:

Fast and effective reordering of columns within supernodes using partition refinement. 76-86 - Yang Liu, Mathias Jacquelin, Pieter Ghysels, Xiaoye S. Li:

Highly scalable distributed-memory sparse triangular solution algorithms. 87-96 - S. M. Ferdous

, Alex Pothen, Arif Khan:
New Approximation Algorithms for Minimum Weighted Edge Cover. 97-108

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














