I am currently a second-year Master student at the ENS de Lyon, and visiting the Aarhus Crypto Group.


Academic curriculum

  • 2018-2019: M2 - Computer science (École Normale Supérieure de Lyon) (Master 2)
  • 2017-2018: M1 - Computer science (École Normale Supérieure de Lyon) (Master 1)
  • 2016-2017: L3 - Computer Science (École Normale Supérieure de Lyon) (Bachelor of Science)
  • 2014-2016: CPGE MPSI/MP option Informatique (Classes Préparatoires Stanislas, Paris)
Here is a full description of the classes I have followed in computer science (NB: NOT my cv).

Internships & Visits

  • Master 2 internship:
    • Upcoming:
      • 1) A revised and extended version of the report, for non-specialists
      • 2) A condensed version, summarising the results for specialists
    • Topic: Topology-Hiding Computation
    • Dates: January, 21st - June, 7th 2019
    • Location: Aarhus Crypto Group -- (Aarhus University, DENMARK)
    • Supervisors: Ivan Damgård and Daniel Tschudi
    • Abstract: Expand Abstract
  • Master 1 internship:
    • Topic: Performance Analysis of Rectangular Codes with Minimal Feedback Information
    • Dates: May, 14th - August, 17th 2018
    • Location: Thales Communications & Security (Gennevilliers, FRANCE)
    • Supervisor: Antoine Roux
    • Report: Unavailable
  • Undergraduate internship :
    • Topic: Dynamic Connexity and Parameterised complexity
    • Dates: June, 19th - July, 28th 2017
    • Location: LIP6 (Laboratoire d'Informatique de Paris 6, FRANCE)
    • Supervisors: Binh-Minh Bui-Xuan and Clémence Magnien
    • Report: Main (pdf)
    • Abstract: Expand Abstract


Workshops, Conferences, etc.

  • 2017:
    • B-M. Bui-Xuan, C. Magnien, and P. Meyer. Kernelization algorithms for some link stream editing problems. 8th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2017), [Abstract], Toronto, CANADA.

Journal Publications

In Preparation

  • B-M. Bui-Xuan, P. Meyer, and A. Roux. Lightweight FEC: Rectangular Codes with Minimum Feedback Information. [arXiv]

Research Interests

I enjoy all problems regarding discrete mathematics and computer science, and especially (or at least more actively/recently) the algorithmic and combinatorial aspects of the following disciplines:
  • Combinatorics & Graph Theory
  • Cryptography (Topology-Hiding Computation, and the study of communication graphs in the context of MPC in particular)