Laurent Feuilloley
Scholar

Laurent Feuilloley

Google Scholar ID: zoQzRrEAAAAJ
CNRS, LIRIS, Université Lyon 1
Distributed computingAlgorithmsGraph theory
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
535
 
H-index
13
 
i10-index
17
 
Publications
20
 
Co-authors
0
 
Contact
GitHubOpen ↗
Publications
5 items
The local complexity of certifying parity
2026
Cited
0
Polynomial Time Local Decision Revisited
2026
Cited
0
Proving there is a leader without naming it
2025
Cited
0
Complexity landscape for local certification
2025
Cited
0
Renaming in distributed certification
arXiv.org · 2024
Cited
3
Resume
Academic Achievements
  • Publications:
  • - By year
  • - By topic
  • - DBLP
  • - Google Scholar
  • - ORCID
  • Peer review:
  • - List of program committees and reviews
  • - List of COIs
  • Talks:
  • - List of talks
  • Events:
  • - List of events I (co-)organized
  • Teaching and mentoring:
  • - Teaching a bit at the computer science department of the University of Lyon, and at ENS Lyon
  • - Advising a few students
  • - List of courses (in French)
  • - List of students
Research Experience
  • CNRS junior researcher (Chargé de recherche)
  • LIRIS (UMR CNRS 5205)
  • Université Lyon 1
  • - Co-organizing the MoMA, a week of algorithms in Fall 2025 in Aussois (with Tatiana Starikovskaya)
  • - Member of the board (bureau) of the French Algorithms and Complexity interest group, GT CoA
  • - CNRS point of contact for sustainable development for LIRIS and GDR IFM
Background
  • Research interests: Theoretical computer science, with a focus on distributed computing and graphs.
Miscellany
  • Personal interests:
  • - Concerned about climate change, among other things
  • - Column in SIGACT News
  • - TCS for Future manifesto
  • - Personal blog