Bruno Courcelle
| Bruno Courcelle | |
|---|---|
| Citizenship | French |
| Fields | Graph theory, Computer science |
| Institutions | University of Bordeaux 1 |
| Alma mater | French Institute for Research in Computer Science and Automation |
| Thesis | (1976) |
| Known for | Courcelle's theorem |
Bruno Courcelle is a French mathematician and computer scientist, best known for Courcelle's theorem in graph theory.
Life
Courcelle earned his Ph.D. in 1976 from the French Institute for Research in Computer Science and Automation, then called IRIA, under the supervision of Maurice Nivat. He then joined the Laboratoire Bordelais de Recherche en Informatique (LaBRI) at the University of Bordeaux 1, where he remained for the rest of his career.[1] He has been a senior member of the Institut Universitaire de France since 2007.[2]
A workshop in honor of Courcelle's retirement was held in Bordeaux in 2012.[1][3]
Work
He is known for Courcelle's theorem, which combines second order logic, the theory of formal languages, and tree decompositions of graphs to show that a wide class of algorithmic problems in graph theory have efficient solutions.
References
- 1 2 Bruno Courcelle, text of remarks presented by Maurice Nivatat Courcelle workshop, retrieved 2014-06-24.
- ↑ Bruno Courcelle, Institut Universitaire de France, retrieved 2014-06-24.
- ↑ Bruno's workshop, June 18-20, 2012, LaBRI, Bordeaux, retrieved 2014-06-24.