Afonso Ferreira

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 K. Marcus

> Home > Persons > Afonso Ferreira

Publications

2002
[j39]
- view
  authority control:
- export record
  dblp key:
  - journals/concurrency/FerreiraLMR02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/FerreiraLMR02
Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin:
Parallel computation on interval graphs: algorithms and experiments. Concurr. Comput. Pract. Exp. 14(11): 885-910 (2002)
1998
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/cn/BourdinFM98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cn/BourdinFM98
H. Bourdin, Afonso Ferreira, K. Marcus:
A Performance Comparison Between Graph and Hypergraph Topologies for Passive Star WDM Lightwave Networks. Comput. Networks 30(8): 805-819 (1998)
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/FerreiraLMR98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/FerreiraLMR98
Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin:
Parallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments. Euro-Par 1998: 875-886
1996
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/BourdinFM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/BourdinFM96
H. Bourdin, Afonso Ferreira, K. Marcus:
On Stack-Graph OPS-Based Lightwave Networks. Euro-Par, Vol. I 1996: 218-221

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.