Rachid Guerraoui
Nationality: Morroccan & Swiss & French
EPFL IC IINFCOM DCL
INR 310 (Bâtiment INR)
Station 14
1015 Lausanne
+41 21 693 52 72
Office:
INR 310
EPFL › IC › IINFCOM › DCL
Website: https://dcl.epfl.ch/
+41 21 693 52 72
EPFL › IC › IC-SSC › SSC-ENS
Website: https://ssc.epfl.ch
+41 21 693 52 72
EPFL › IC › IC-SIN › SIN-ENS
Website: https://sin.epfl.ch
Expertise
Current work
Awards
Dahl-Nygaard prize
European Conference on Object Oriented Programming (ECOOP)
2024
Google Focused Award
2013
Barroso Award
ACM
2025
Best Professor Award
EPFL IC
2025
Jean-Claude Laprie
IEEE
2025
Elected to Academia Europea
Europea
2025
ACM Fellow
ACM
2012
Infoscience
Teaching & PhD
PhD Students
Beatrice Shokry Samir Shokry, Abdellah El Mrini, Cristian-Alexandru Botocan, Clément Burgelin, Diana Andreea Petrescu, Antoine Murat
Past EPFL PhD Students
Assia Doudou, Romain Boichat, Patrick Eugster, Sidath Handurukande, Partha Dutta, Petr Kouznetsov, Sébastien Bähni, Bastian Pochon, Ron Levy, Marko Vukolic, Jesper Honig Spring, Maxime Monod, Michal Kapalka, Aleksandar Dragojevic, Nikola Knezevic, Dan Alistarh, Giuliano Losa, Mihai Letia, Radu Banabic, Victor Bushkov, Vasileios Trigonakis, David Kozhaya, Tudor Alexandru David, Rhicheek Patra, Jingjing Wang, Mahsa Taziki, Georgios Chatzopoulos, Matej Pavlovic, Dragos-Adrian Seredinschi, Mihail Igor Zablotchi, El Mahdi El Mhamdi, Karolos Antoniadis, Georgios Damaskinos, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis, Athanasios Xygkis, Matteo Monti, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Sadegh Farhadkhani, Youssef Allouah, John Stephan
Past EPFL PhD Students as codirector
Oana Anca Jurca, Maysam Yabandeh, Anastasiia Kucherenko
Courses
Concurrent computing
CS-453
With the advent of modern architectures, it becomes crucial to master the underlying algorithmics of concurrency. The objective of this course is to study the foundations of concurrent algorithms and in particular the techniques that enable the construction of robust such algorithms.
Distributed algorithms
CS-451