María Luisa Bonet Carbonell is a Spanish computer scientist interested in logic in computer science, including proof complexity and algorithms for the maximum satisfiability problem. She is a professor of computer science at the Polytechnic University of Catalonia.[1]

Education and career

Bonet is originally from Barcelona.[2] After earning a degree in philosophy at the University of Barcelona in 1984,[3] she became a Fulbright Fellow at the University of California, Berkeley.[2] She earned a master's degree in mathematics there in 1987,[3] and became a doctoral student of Samuel Buss, studying theoretical computer science.[2] Buss moved to the University of California, San Diego in 1988,[4] but Bonet remained at Berkeley; her 1991 doctoral dissertation, The Lengths of Propositional Proofs and the Deduction Rule, listed both Buss and Leo Harrington as co-advisors.[5]

Bonet did postdoctoral research as a Warchawski Assistant Professor at the University of California, San Diego, at the University of Pennsylvania, and at DIMACS in New Jersey. She returned to Barcelona in 1996, to take a position in the computer science department of the Polytechnic University of Catalonia. She became a full professor there in 2007.[2]

Selected publications

References

  1. ↑ "People", Computer Science Department, Polytechnic University of Catalonia
  2. 1 2 3 4 "María Luisa Bonet Carbonell", People, Simons Institute, retrieved 2023-03-14
  3. 1 2 Curriculum vitae, retrieved 2023-03-14 – via Docplayer.es
  4. ↑ "Sam Buss", People, Simons Institute, retrieved 2023-03-14
  5. ↑ María Luisa Bonet at the Mathematics Genealogy Project
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.