Ricardo Peña-Marí

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 Silvia Breitinger

> Home > Persons > Ricardo Peña-Marí

Publications

1997
[c17]
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/agp/BreitingerLOP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/agp/BreitingerLOP97
Silvia Breitinger, Rita Loogen, Yolanda Ortega-Mallén, Ricardo Peña-Marí:
High-level Parallel and Concurrent Programming in Eden. APPIA-GULP-PRODE 1997: 213-224
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/hips/BreitingerLOP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hips/BreitingerLOP97
Silvia Breitinger, Rita Loogen, Yolanda Ortega-Mallén, Ricardo Pena:
The Eden Coordination Model for Distributed Memory Systems. HIPS 1997: 120-124
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/ifl/BreitingerKLOP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifl/BreitingerKLOP97
Silvia Breitinger, Ulrike Klusik, Rita Loogen, Yolanda Ortega-Mallén, Ricardo Pena:
DREAM: The DistRibuted Eden Abstract Machine. Implementation of Functional Languages 1997: 250-269
1996
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/BreitingerLOP96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/BreitingerLOP96
Silvia Breitinger, Rita Loogen, Yolanda Ortega-Mallén, Ricardo Peña-Marí:
Eden - The Paradise of Functional Concurrent Programming. Euro-Par, Vol. I 1996: 710-713

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.