Sylvain Contassot-Vivier

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 Pierre-Cyrille Héam

> Home > Persons > Sylvain Contassot-Vivier

Publications

2019
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/ieeehpcs/Contassot-Vivier19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ieeehpcs/Contassot-Vivier19
Sylvain Contassot-Vivier, Jean-François Couchot, Mohammed Bakiri, Pierre-Cyrille Héam:
Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that. HPCS 2019: 650-657
2017
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/ijbc/Contassot-Vivier17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijbc/Contassot-Vivier17
Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux, Pierre-Cyrille Héam:
Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. Int. J. Bifurc. Chaos 27(1): 1750014:1-1750014:18 (2017)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/Contassot-Vivier17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Contassot-Vivier17
Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux, Pierre-Cyrille Héam:
Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. CoRR abs/1702.02533 (2017)

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.