I am an Assistant Professor since 2020 within the Network and Systems unit, in the division of Computer and Network Systems, Department of Computer Science and Engineering, a shared department between Chalmers University of Technology and University of Gothenburg (IT Faculty). Within the unit, I am taking part in the Distributed Computing and Systems group located in EDIT building at Johanneberg Campus. Research-wise, I am currently mainly working on different distributed problems targeting the efficient usage of data communication channels, and dealing with distributed systems and mobile networking, big data analysis and streaming analytics for Cyber-Physical Systems (CPS), 5G core network architecture, connected and autonomous vehicles, distributed power systems and efficient P2P energy sharing.
My current research projects are Passive Attacks on 5G Networks (PAN5G) (main PI, Chalmers Area of Advance ICT) in collaboration with Andres Alayon Glazunov, Dynamic and Efficient Energy-sharing P2P networks (DEEP) (PI, AoA Energy), and AutoSPADA (Automotive Stream Processing and Distributed Analytics) OODIDA Phase 2 project (co-PI, VINNOVA Swedish Innovation Agency, in collaboration with Volvo Car Corporation, Volvo Trucks, Fraunhofer-Chalmers Centre and Alkit Communications AB) working with Marina Papatriantafilou, Vincenzo Gulisano, and Bastian Havers (industrial PhD student at Volvo).
I have recently been working on bringing P2P-inspired energy trading policies to communities of prosumer households as part of the ADAPT: Adaptive DigitAl Power sysTems project in collaboration with Marina Papatriantafilou and Vincenzo Gulisano, as well as Lisa Göransson and Verena Heinisch from Chalmers's Division of Energy Technology within the Department of Space, Earth and Environment, Energy Technology. My other main interest is on parallel and distributed data streaming in vehicular and other CPS. I participated as part as my 2017-2019 postdoc position in the On-board Off-board Distributed Data Analytics (OODIDA) project, working in collaboration with Bastian Havers, Vincenzo Gulisano and Marina Papatriantafilou. My previous research interests focused on maintenance of random graph distributions in a distributed environment. The main research focus of my thesis was about finding and analysing interesting and realistic models of random graphs, which admit efficient maintenance algorithms.
Temporary Teaching and Research Fellow (French: ATER for Attaché Temporaire à l'Enseignement et à la Recherche) working at Theoretical Computer Science Laboratory (LIF) and teaching at the Faculty of Science of Aix-Marseille Université. I worked in the Distributed Algorithms (DALGO) team within the LIF.
ATER teaching at the Computer Science department of the University of Bordeaux and working at the Computer Science Research Laboratory of Bordeaux (French: LaBRI - short for Laboratoire Bordelais de Recherche en Informatique).
My thesis is titled Maintenance and simulation of dynamic random graphs and has been supervised by Pr Philippe Duchon. I defended my thesis on the 16th of October 2015 (slides, in french) with the following jury: Conrado Martínez and Vlady Ravelomanana (thesis reviewers); Ralf Klasing (president), Cyril Nicaud, Emmanuel Godard and Danièle Gardy. During my PhD, I belonged to the Mathematics and Computer Science Doctoral School (French: École Doctoral de Mathématiques et d'Informatique) of the University of Bordeaux. As part of my PhD contract, I taught at the Computer Science Department of the University Institute of Technology of Bordeaux for three academic years.
You can find my résumé here.
You might meet me at a nearby climbing gym very close to my office, but of course I'm also always ready if you're motivated to get out your best friends and climb some crags around Gothenburg. I used to climb regularly in the Marseille region. My level on natural rocks is about 6a/6a+ on sight for equipped (multi-pitches) routes.
As a pastime, I like to solve StackExchange Code Golf puzzles. I have also participated in Google Ai Challenge 2010 and Google Ai Challenge 2011.
I have coded a self-interpretor in the beautiful BF language which appears to be 2nd smallest known so far to my knowledge:
>>>+[,>++++[-<-------->]<-[----------[-[-[-[--------------[--[>++++[-<------->]<-[--[[-]>+>+<<]<+>>--<]<+>>+<]<+>]<+>]<+>]
<+>]<+>]<+>>[-<+>]>[-<<<[-]>]+<]>]<+++++++++[->[>>]+[<<]>]<<<[<<]>>[[[>>]>+<<<[<<]>+>-]<[-<+>]>>[-<<+>>]>[>>]>[[->>+<<]>>-
]+<[<<]>>>[->[>>]<+<[<<]>]>>[->[>>]<,<[<<]>]>>[->[>>]<-<[<<]>]>>[->[>>]<.<[<<]>]>>[->[>>]<<-<<[<<]>]>>[->[>>]+[<<]>]>>[->[
>>]<[<[<<]>]<[[<<]<<[<<]>+[>[-<<+>>]<[->+<]>>[-<+<+>>]<[->+<]>]>[>>]]>]>>[->[>>]<[<[<<]<<[<<]>-<<<[->>+<<]->+<[<[->+>+<<]>
[-<+>]<<[->>+<<]>[-<+>]<]>>[>>]>]<[<<]>]<[<<]<<[<<]>>]
I like to travel and to learn foreign languages.