I am currently a fourth-year student at the ENS de Lyon, and visiting the FACT Research Center of the IDC Herzliya.

Studies


Academic curriculum

  • 2019-2020: 'Projet long de recherche' (École Normale Supérieure de Lyon) (a year of research)
  • 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)

Internships & Visits

  • Master 2 internship:
    • Topic: Topology-Hiding Computation
    • Dates: January, 21st - June, 7th 2019
    • Location: Aarhus Crypto Group -- (Aarhus University, DENMARK)
    • Supervisors: Ivan Damgård and Daniel Tschudi
    • Report: Main (pdf) -- Appendix (pdf) (under revision)
    • 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

Research


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


Pre-Prints

  1. B-M. Bui-Xuan, P. Meyer, and A. Roux. Lightweight FEC: Rectangular Codes with Minimum Feedback Information. [arXiv]
  2. B-M. Bui-Xuan, C. Magnien, P. Meyer, and HD. Phan. Link Stream Edition: Sparse Split and Bi-Sparse Split. [math.ac.vn]

Research Interests

I enjoy all problems of discrete mathematics and (theoretical) computer science, but my most active research interest are the following:
  • Combinatorics & Graph Theory
  • Cryptography (Communication & computation over incomplete networks, and Topology-Hiding Computation in particular)