Robert Robere

Robert Robere is an Assistant Professor in the School of Computer Science at McGill University. His research focuses on computational complexity theory, particularly proof complexity, circuit complexity, and communication complexity. He holds a PhD from the University of Toronto and has held research positions at the Simons Institute (UC Berkeley), the Institute for Advanced Study (Princeton), and DIMACS. Robere has received several awards, including the 2019 EATCS Distinguished Dissertation Award and multiple Simons-Berkeley fellowships. His work bridges theoretical computer science with practical applications in algorithm design and formal methods.

Education:

• PhD in Computer Science (2013–2018), University of Toronto (Advisors: Toniann Pitassi, Stephen Cook)
• MSc in Computer Science (2012–2013), University of Toronto
• BSc (Honours) in Computer Science (2007–2012), Memorial University of Newfoundland

Research Highlights:

• Expertise in proof complexity and lower bounds for monotone computation
• Contributions to circuit complexity, communication complexity, and TFNP (Total Search Problems)
• Co-organizer of workshops on proof complexity and meta-complexity

Awards:

• 2019 EATCS Distinguished Dissertation Award
• NSERC Postdoctoral Fellowship (2018–2020)
• Simons-Berkeley Research Fellowships (2022, 2018)

Teaching & Service:

• Current courses: Algorithm Design (COMP 360), Graduate School Fundamentals (COMP 604)
• Program committee member for STOC, IJCAI, and ITCS
• Advisor for the Undergraduate Computer Science Research Symposium (UCORE)