Radu Prodan

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

◁ ▶ single authored publications

> Home > Persons > Radu Prodan

Publications

2009
[c48]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/Prodan09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/Prodan09
Radu Prodan:
Preface. Euro-Par Workshops 2009: 241-243
2008
[p2]
- view
  authority control:
- export record
  dblp key:
  - reference/wiley/Prodan08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/reference/wiley/Prodan08
Radu Prodan:
Clusters and Grids. Wiley Encyclopedia of Computer Science and Engineering 2008
2007
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/fgcs/Prodan07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fgcs/Prodan07
Radu Prodan:
Specification-correct and scalable coordination of Grid applications. Future Gener. Comput. Syst. 23(4): 587-605 (2007)
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/ccgrid/Prodan07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccgrid/Prodan07
Radu Prodan:
Specification-correct and Scalable Coordination of Scientific Applications in Grid Environments. CCGRID 2007: 371-380
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/ccgrid/Prodan07a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccgrid/Prodan07a
Radu Prodan:
Online Analysis and Runtime Steering of Dynamic Workflows in the ASKALON Grid Environment. CCGRID 2007: 389-400

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.