About Me

Ahoy there! My name is Stefan Grosser, and I am a PhD student in Computer Science at McGill studying under Robert Robere. My research interests are in proof complexity, bounded arithmetic,  communication complexity, and extremal combinatorics.

From January through May 2023, I was a visiting graduate student at the Simons Institute for the Meta-Complexity program.

I had the absolute privilege of working with Hamed Hatami and Sergey Norin for my Master's in Mathematics at McGill, and Alejandro Morales during my final year at UMass Amherst.

If I'm not doing math or programming, you'll find me climbing, baking, playing my oud, or drinking a cup of tea.


                 - arXiv link, SIAM link
                 - JMM 2019 poster. Won the MAA Outstanding Poster Award
                 - Poster at FPSAC 2022

Surveys and Lecture Notes:
  • Directed Reading Project on Crossing Numbers
    • Massimo Vicenzo

  • Teaching Assistant for Comp 330 (Theory of Computation) at McGill, Winter 2022
  • Teaching Assistant for Comp 360 (Algorithm Design and Analysis) at McGill, Fall 2021
  • Teaching Assistant for Math 240 (Discrete Mathematics) at McGill, Winter 2021
  • Teaching Assistant for Comp 251 (Algorithms and Data Structures) at McGill, Winter 2020
  • Teaching Assistant for Math 140 (Calculus 1) at McGill, Fall 2019
  • Teaching Assistant for Math 300 (Intro to Proofs) at UMass Amherst, Fall 2018
  • Grader for CS 311 (Intro to Algorithms) at UMass Amherst, Fall 2016, Fall 2017 and Spring 2018
  • Grader for CS 501 (Formal Language Theory) at UMass Amherst, Spring 2017

  • Google Summer of Code 2020: Adding Efficient Counting of Linear Extensions to SageMath
           - Mentored by Travis Scrimshaw




Contact me at myfirstname.mylastname @ mail.mcgill.ca


Popular posts from this blog

Extension Complexity Part II - Classifying Nonnegative Rank by Randomized Communication

Learning Bounded Arithmetic -- A Guide from a Novice

The Catalan Grenade is Accepting Papers!