Roman Iakymchuk

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with David Defour

> Home > Persons > Roman Iakymchuk

Publications

2019
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/ijhpca/IakymchukGDQ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijhpca/IakymchukGDQ19
Roman Iakymchuk, Stef Graillat, David Defour, Enrique S. Quintana-Ortí:
Hierarchical approach for deriving a reproducible unblocked LU factorization. Int. J. High Perform. Comput. Appl. 33(5) (2019)
2015
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/pc/CollangeDGI15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/CollangeDGI15
Caroline Collange, David Defour, Stef Graillat, Roman Iakymchuk:
Numerical reproducibility for the parallel reduction on multi- and many-core architectures. Parallel Comput. 49: 83-97 (2015)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/itng/IakymchukDCG15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itng/IakymchukDCG15
Roman Iakymchuk, David Defour, Caroline Collange, Stef Graillat:
Reproducible Triangular Solvers for High-Performance Computing. ITNG 2015: 353-358
2014
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/scan/IakymchukDCG14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/scan/IakymchukDCG14
Roman Iakymchuk, David Defour, Caroline Collange, Stef Graillat:
Reproducible and Accurate Matrix Multiplication. SCAN 2014: 126-137

a service of

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.