Yann Barsamian

Inria de Paris
Équipe COSMIQ
2 rue Simone Iff
75012 Paris
FRANCE

yann.barsamian@inria.fr















Positions

2020-current Post-doc at INRIA de Paris (France)
2019 Post-doc at the Université Libre de Bruxelles (Belgium)
2014-2018 PhD in Computer Science at the Université de Strasbourg (France)
2009-2014 Mathematics and algorithmics teacher in high school (France)


Main research topics

Post-doc 2 (Paris, France): relativistic cryptography, zero-knowledge proofs. More information on this ANR project (in French).

Post-doc 1 (Brussels, Belgium): data structures (suffix tree / array, inverted index), compression (space-time tradeoff), cryptography. More information on this github project.

PhD (Strasbourg, France): optimisation (loop optimisation, cache misses) and parallelisation (MPI, OpenMP, vectorisation) for High Performance Computing, reproducibility, numerical simulations for plasma physics (Particle-in-Cell, Semi-Lagrangian). More information on this dedicated webpage.



Teaching

FRENCH : some teaching material for the C2I (Certificat Informatique et Internet) : ressources de formation, plateforme d'entraînement aux QCM théoriques. Today, the C2I became pix (not an acronym) : site officiel, ressources de formation.

FRENCH : some teaching material for High School in mathematics and algorithmics ; feel free to use it with your students : Seconde, Terminale S, Première STSS, Terminale ST2S and BTS SIO.

FRENCH : some teaching material for teachers in mathematics / computer science / geography ; feel free to use it : the link. Some of this material is part of the biannual Université d'été espace éducation of the Centre National d'Études Spatiales (CNES, Toulouse).

Publications

Y. Barsamian,
  Pic-Vert: A Particle-in-Cell Implementation for Multi-Core Architectures, 2018, .pdf, .bib.
  * Presentation for the defense with the following slides.
  * More information on this dedicated webpage.

Y. Barsamian, A. Charguéraud, S. Hirstoaga, and M. Mehrenberger,
  Efficient Strict-Binning Particle-in-Cell Algorithm for Multi-Core SIMD Processors, 2018, .pdf, .bib.
  * Presentation at Euro-Par 2018, with the following slides.
  * Artifacts available, https://doi.org/10.6084/m9.figshare.6391796 (“Best Artifact Award”).
  * Publication in European Conference on Parallel Processing: 24th International Conference (Euro-Par), pp. 749–763, Springer link.

Y. Barsamian, S. Hirstoaga, and É. Violard,
  Efficient Data Layouts for a Three-Dimensional Electrostatic Particle-in-Cell Code, 2018, .pdf, .bib.
  * Publication in Journal of Computational Science 27 (2018), pp. 345–356, Elsevier link.

Y. Barsamian, A. Charguéraud, and A. Ketterlin,
  A Space and Bandwidth Efficient Multicore Algorithm for the Particle-in-Cell Method, 2017, .pdf, .bib.
  * Presentation at PPAM 2017, with the following slides.
  * Publication in Parallel Processing and Applied Mathematics: 12th International Conference (PPAM), pp. 133–144, Springer link.

Y. Barsamian, S. Hirstoaga, and É. Violard,
  Efficient Data Structures for a Hybrid Parallel and Vectorized Particle-in-Cell Code, 2017, .pdf, .bib.
  * Presentation at IPDPSW 2017, with the following slides.
  * Publication in 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 1168–1177, IEEE link.

Y. Barsamian, J. Bernier, S. Hirstoaga, and M. Mehrenberger,
  Verification of 2D x 2D and two-species Vlasov-Poisson solvers, 2016, .pdf, .bib.
  * Presentation at CEMRACS 2016, with the following slides.
  * Publication in ESAIM: Proceedings and Surveys 63, pp. 78–108, ESAIM Procs link.

Preprints

Y. Barsamian,
  Maximum Subarray Problem in 1D and 2D via Weighted Paths in Directed Acyclic Graphs, 2016, .pdf, .bib.