Citizenship French Thesis 1976 | Name Bruno Courcelle | |
 | ||
Fields Graph theory, Computer Science | ||
Bruno courcelle recognizable sets of graphs algebraic and logical aspects
Bruno Courcelle is a French mathematician and computer scientist, best known for Courcelle's theorem in graph theory.
Contents
- Bruno courcelle recognizable sets of graphs algebraic and logical aspects
- Bruno Courcelle LaBRI On the constructive power of monadic second order logic
- Life
- Work
- References
Bruno Courcelle (LaBRI) / On the constructive power of monadic second-order logic
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. He has been a senior member of the Institut Universitaire de France since 2007.
A workshop in honor of Courcelle's retirement was held in Bordeaux in 2012.
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.