Bruno Courcelle is a French mathematician and computer scientist, best known for Courcelle's theorem in graph theory, 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. He 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 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, was the first recipient of the S. Barry Cooper Prize of Computability in Europe in 2020, and was awarded the EATCS-IPEC Nerode Prize in 2022.
Facts
Connections
In Branch
Source Wikipedia: Bruno Courcelle
Proofs Credited
Source Courcelle's theorem - Wikipedia
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Bruno Courcelle
LeadQuote, Lead
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.
View the Source Courcelle's theorem - Wikipedia
Proofs Credited: Courcelle's Theorem, Lead sentence, attributionQuote, Proofs Credited: Courcelle's Theorem, Lead sentence, attribution
first proved by Bruno Courcelle in 1990
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.