Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Peter Kilpatrick

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 Maurizio Drocco

> Home > Persons > Peter Kilpatrick

Publications

2018
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/tjs/AldinucciDDKMPT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/AldinucciDDKMPT18
Marco Aldinucci, Marco Danelutto, Maurizio Drocco, Peter Kilpatrick, Claudia Misale, Guilherme Peretti Pezzi, Massimo Torquati:
A parallel pattern for iterative stencil + reduce. J. Supercomput. 74(11): 5690-5705 (2018)
2016
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AldinucciDDKMPT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AldinucciDDKMPT16
Marco Aldinucci, Marco Danelutto, Maurizio Drocco, Peter Kilpatrick, Claudia Misale, Guilherme Peretti Pezzi, Massimo Torquati:
A parallel pattern for iterative stencil + reduce. CoRR abs/1609.04567 (2016)
2015
[c61]
- view
  authority control:
- export record
  dblp key:
  - conf/trustcom/AldinucciDDKPT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/trustcom/AldinucciDDKPT15
Marco Aldinucci, Marco Danelutto, Maurizio Drocco, Peter Kilpatrick, Guilherme Peretti Pezzi, Massimo Torquati:
The Loop-of-Stencil-Reduce Paradigm. TrustCom/BigDataSE/ISPA (3) 2015: 172-177

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.