Explore projects

Estimation de la taille d’un graphe par marches aléatoires

Project for INF567: Wireless Networks Data dissemination in connected vehicle scenarios

Code Lens Python

Travail pour le cours MAP552: Calcul stochastique en finance

Le client de Chocapix, le site des bars d'étage

formation github

Solving the problem of finding a minimal partition of a geometric graph into plane subgraphs. Problem given at the Fourth Computational Geometry Challenge, as part of CG Week in Berlin.