Bruno Courcelle: Difference between revisions
New article |
(No difference)
|
Revision as of 05:56, 25 June 2014
Bruno Courcelle is a French mathematician and computer scientist. 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.[1]
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.[2] He has been a senior member of the Institut Universitaire de France since 2007.[3]
A workshop in honor of Courcelle's retirement was held in Bordeaux in 2012.[4][2]
References
- ^ Eger, Steffen (2008), Regular Languages, Tree Width, and Courcelle's Theorem: An Introduction, VDM Publishing, ISBN 9783639076332.
- ^ a b 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.