Florian Richoux

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 Diaz 0001

> Home > Persons > Florian Richoux

Publications

2015
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/constraints/CaniouCRDA15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/constraints/CaniouCRDA15
Yves Caniou, Philippe Codognet, Florian Richoux, Daniel Diaz, Salvador Abreu:
Large-scale parallelism for constraint-based local search: the costas array case study. Constraints An Int. J. 20(1): 30-56 (2015)
2012
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/DiazRCCA12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/DiazRCCA12
Daniel Diaz, Florian Richoux, Yves Caniou, Philippe Codognet, Salvador Abreu:
Parallel Local Search for the Costas Array Problem. IPDPS Workshops 2012: 1793-1802
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/lion/DiazRCCA12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lion/DiazRCCA12
Daniel Diaz, Florian Richoux, Philippe Codognet, Yves Caniou, Salvador Abreu:
Constraint-Based Local Search for the Costas Array Problem. LION 2012: 378-383
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/ppopp/CaniouDRCA12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppopp/CaniouDRCA12
Yves Caniou, Daniel Diaz, Florian Richoux, Philippe Codognet, Salvador Abreu:
Performance analysis of parallel constraint-based local search. PPoPP 2012: 337-338

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.