Robert Robere
announcements | research | teaching | fun
I am an Assistant Professor in the School of Computer Science at McGill University. My research interests are in computational complexity theory, and particularly in circuit complexity, proof complexity, communication complexity, and related topics. I also maintain an interest in the theory and practice of SAT solving and model checking.
You can look at my curriculum vitae for more of my (professional) past life, if you're interested in that sort of thing. Otherwise, you can continue on to find my research papers, my students, or my recent teaching.
contact
E-Mail: robere [at] cs [dot] mcgill [dot] caOffice: MC 309
McConnell Engineering Building
McGill University
Montréal, QC, Canada
If you are a McGill undergraduate looking for advising, please note that I currently play two advising roles in SOCS:
- I am the special advisor to the school in charge of things like course substitutions or other related program issues.
- I am the graduate advisor for undergraduate students, answering questions regarding preparing for graduate school, applying for graduate scholarships, and other closely related issues.
If you are an undergraduate student falling into either of these two cases please feel free to reach out. If you have already sent me an e-mail and I haven't responded, please do not be afraid to ping me again — it is likely that your e-mail was buried and I don't mind reminders!
announcements
September 13, 2022. This year I am returning as the head organizer of the Undergraduate Computer Science Research Symposium (UCORE) at McGill, which is our annual symposium for students in the School of Computer Science. If you are an undergraduate SOCS student who has participated in research over the past year then I strongly encourage you to submit to the symposium. Please see the UCORE website for more details.
February 10, 2022. At FOCS 2021 I co-organized a workshop on recent progress in Propositional Proof Complexity. The schedule for the workshop is available, and the talks were recorded and are now publicly available. Of particular interest to many may be the following list of open problems in proof complexity, which were assembled by the speakers of the workshop and which we seek to distribute widely.
