Laurent Feuilloley: Talks

Invited talk at AGAPE workshop about secretary problem with sampling (December 2022).
Invited talk at SIROCCO 2022 about local certification and model checking. Slides.
Invited talk at ADGA 2021 workshop about Local certification of graph classes. Long prerecorded video and slides.
Gem talk at PODC 2021 about "How to locally certify a global property? From spanning trees to planar graphs, and beyond". Video.

Talk at the NESTiD seminar (Durham/Liverpool, online) giving an overview of local certification. (Jan. 2023)
Talk at the GT Graphes et Optimisation of Labri (Bordeaux, online), about local certification and its connection to other fields. (Apr. 2022)
Talk at the discrete maths seminar of G-SCOP combinatorial optimization team in Grenoble, about local certification of graph classes. (Mar. 2022)
Talk at the Computer Science department of the University of Cologne, about local certification in distributed computing. (Feb. 2022)
Talk at the distributed algorithms seminar (DALGO) of Aix-Marseille University about local certification of graph classes. (Feb. 2022)
Talk at the Aatlo CS Theory seminar (Helsinki, Finland) about The Secretary Problem with Independent Sampling (Sept. 2021)
Talk at Marseille's LIS Pôle Calcul seminar about local certification of planar and bounded genus graphs (based on this and that papers) (2021).
Talk at the Paris game theory seminar about The Secretary Problem with Independent Sampling (May 2021).
Talk at ENS Lyon MC2 seminar about The Secretary Problem with Independent Sampling (March 2021).
Talk at Sophia-Antipolis/Nice's COATI Seminar about local certification of planar and bounded genus graphs (based on this and that papers) (2021).
Talk at ENS Paris Talgo seminar about The Secretary Problem with Independent Sampling (2021).
Talk at Bordeaux's Distributed Algorithms Seminar about local certification of planar and bounded genus graphs (2021).
Talk at the IRIF graph seminar (University of Paris) about Graph classes and forbidden patterns on three vertices (2020)
Talk at the Rhone-Alpes and Auvergne graph seminar (GRAA) about Compact Distributed Certification of Planar Graphs (2020).
Talk at the AGCO seminar (Santiago de Chile) about Graph classes and forbidden patterns on three vertices (2019).
Talk at the ENS TALGO seminar about local certification (2018).
Talk at Sorbonne University's DELYS seminar about local certification (2018).
Talk at Bordeaux's distributed algorithms seminar about Error-Sensitive Proof-Labeling Schemes (2017)

Talk at SAND 2023 about When Should You Wait Before Updating? Toward a Robustness Refinement.
Talk at PODC 2022 about What can be certified compactly? Compact local certification of MSO properties in tree-like graphs.
Talk at OPODIS 2021 about Local certification of graph decompositions and applications to minor-free classes.
Talk at SODA 2021 about The Secretary Problem with Independent Sampling.
Talk at SSS 2020 about Silent MST approximation for tiny memory.
Talks at DISC 2018 about Redundancy in Distributed Proofs and Local verification of global proofs.
Talk at DISC 2017 about Error-Sensitive Proof-Labeling Schemes.
Talk at SIROCCO 2017 about How long it takes for an ordinary node with an ordinary ID to output?.
Talk at ICALP 2016 about A Hierarchy of Local Decision.
Talk at SPAA 2015 about Randomized Local Network Computing.
Talk at LATIN 2014 about Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line.

Talk at ANR tempogral meeting (July 3-5 2023, Paris Area), about When Should You Wait Before Updating? Toward a Robustness Refinement
Talk at the workshop Distributed Algorithms: past, present & future trends (Maurice Herlihy CNRS-ambassador workshop) at LIP6 on June 13, about Local compact certification.
Talk at the FRAIGNIAUD workshop at IRIF, Paris, November 28 2022, about a story of local certification.
Talk at ICGT 2022 about What can be certified compactly?. Slides.
Talk at the CNRS Graphs and algorithms days JGA 2021 about Local certification of graph decompositions and applications to minor-free classes.
Talk at the ANR GrR meeting about reconfiguration of independent sets.
Talk at the CNRS Graphs and algorithms days JGA 2020 about Graph classes and forbidden patterns on three vertices.
Talk at the ANR Estate meeting about Local verification of global proofs (2019).
Talk at the CNRS 2019 complexity and algorithm workshop (GT CoA) about Lower bounds for text indexing with mismatches and differences (2019).
Talk at FILOFOCS 2018 about Local verification of global proofs
I gave a short talk at HALG 2018 about Error-Sensitive Proof-Labeling Schemes
Talk at ANR Descartes 2018 meeting about Redundancy in Distributed Proofs.
Talk at the CNRS 2017 Complexity and algorithms days about Error-Sensitive Proof-Labeling Schemes
Talk at ANR Descartes 2017 meeting about Error-Sensitive Proof-Labeling Schemes.
Talk at GROW 2017 about topics related to Graph classes and forbidden patterns on three vertices.

Poster at HALG 2023 about What can be certified compactly? (June 23, Prague).
Poster at WOLA 2021 about The Secretary Problem with Independent Sampling (June 2021, online).
Poster at HALG 2021 about The Secretary Problem with Independent Sampling (June 2021, online).

Laurent Feuilloley: Talks

Invited talks

Seminar talks

Conference talks

Contributed talks

Posters