José Luis Roda García

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 Daniel González

> Home > Persons > José Luis Roda García

Publications

2000
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/concurrency/GonzalezARR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/GonzalezARR00
Daniel González, Francisco Almeida, José L. Roda, Casiano Rodríguez:
From the Theory to the Tools: Parallel Dynamic Programming. Concurr. Pract. Exp. 12(1): 21-34 (2000)
1997
[c5]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/pdp/RodriguezGARG97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pdp/RodriguezGARG97
Casiano Rodríguez, Daniel González, Francisco Almeida, José L. Roda, F. García:
Parallel algorithms for polyadic problems. PDP 1997: 394-400
1996
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/euromicro/RodriguezRGAG96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/euromicro/RodriguezRGAG96
Casiano Rodríguez, José L. Roda, F. García, Francisco Almeida, Daniel González:
Paradigms for Parallel Dynamic Programming. EUROMICRO 1996: 553-
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/pvm/RodaHGRAG96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pvm/RodaHGRAG96
José L. Roda, J. Herrera, Jorge González, Casiano Rodríguez, Francisco Almeida, Daniel González:
Practical Experiments to Improve PVM Algorithms. PVM 1996: 30-37

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.