Guillaume Lagarde

Associate professor
Computer science ∩ Math
guillaume.lagarde [at] labri [dot] fr

DBLP

• Home
• Publications and Talks
• Teaching

I am an associate professor in computer science at Bordeaux University and LaBRI, member of the teams Logical foundations of computing and Synthesis.

My research interest is mainly in computational complexity and algorithms.

News

• The full version of (1+\(\varepsilon\))-approximation for ultrametric embedding is now available on arXiv.
• Talk at AAAI’25 on Eco Search
• Posters at AAAI’25
  • Eco Search
  • (1+\(\varepsilon\))-approximation for ultrametric embedding
• Talk at Numerics on Recommender Systems. Slides
• Two papers accepted at AAAI’25
  • A (1+\(\varepsilon\))-approximation for ultrametric embedding in subquadratic time, with Gabriel Bathie
  • Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis, with Théo Matricon and Nathanaël Fijalkow
    • Invited for oral presentation
• Talk in Paris at “les journées CoA” on ultrametric embedding in subquadratic time. Slides

Background

Before moving to Bordeaux, I was a research engineer at Criteo (2021–2023), working on large-scale recommendation systems. Previously, I was a postdoc in the DeepSynth CNRS Momentum project (2019–2021) with Nathanaël Fijalkow, and before that, in the Approximation and Proof Complexity group with Jakob Nordström, Johan Håstad, and Per Austrin. I defended my PhD in 2018 at IRIF, University Paris Diderot, under the supervision of Sophie Laplante and Sylvain Perifel.