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. For the summer of 2025, I am a research intern at IBM Exploratory Science team.

I had the 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.


Papers: 
    
  • A Finitary Chaitin Incompleteness Theorem and Uncondition Line Count Separations in Bounded Arithmetic
    •        - Joint work with Marco Carmosino, Isabelle Champion, and Robert Robere
           - [Submitted]
  • Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the Gap
    •        - [Accepted to STOC 2025] Joint work with Marco Carmosino
           - ECCC link
                 - arXiv link, SIAM link
                 - JMM 2019 poster. Won the MAA Outstanding Poster Award
                 - Poster at FPSAC 2022


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

Teaching:
  • 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

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

Github



Seminars:


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

Comments

Post a Comment

Popular posts from this blog

Learning Bounded Arithmetic -- A Guide from a Novice

Bounded Arithmetic is a field of mathematical logic which, very roughly, studies subtheories of Peano Arithmetic that "correspond" with reasoning associated with computational complexity classes or propositional proof systems.  At the Simons Institute program for Meta Complexity this winter, many attendants (including myself) wished to learn bounded arithmetic due to its increasing appearances and connections with other areas of complexity. Marco Carmosino, Oliver Korten, and Jan Pich organized a bounded arithmetic reading group to go through many elementary and recent works in bounded arithmetic, with a preference towards those results relating to meta complexity. However, with the creation of the reading group, a running joke was spawned: " I won't define this bounded arithmetic theory " Every week we would talk about some results in bounded arithmetic, but the speaker would usually not formally define any of the objects discussed! This is because the logical...
Read more