### 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.

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.

Papers:

**Randomness in Proof Complexity and Total Search Problems**

- Joint work with Noah Fleming, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, and Weiqiang Yuan

**On Student-Teacher Games and Consequences of Provability**

- Joint work with Marco Carmosino

**On Semi-algebraic Proofs and Algorithms**

**Typical structure of hereditary properties of binary matroids**

- [Accepted to Journal of Combinatorial Theory Series B] Joint work with Sergey Norin and Hamed Hatami, and Peter Nelson

- arxiv link**Counting Linear Extensions of Posets with Determinants of Hook Lengths**

- [Accepted to SIDMA] Joint work with Alexander Garver, Jacob Matherne, and Alejandro Morales

- arXiv link, SIAM link

- JMM 2019 poster. Won the MAA Outstanding Poster Award

- Poster at FPSAC 2022

- JMM 2019 poster. Won the MAA Outstanding Poster Award

- Poster at FPSAC 2022

Surveys and Lecture Notes:

- Extension Complexity II--Communication Complexity Reading Group lecture (Last updated January 2021)
- Extension Complexity--Communication Complexity Reading Group lecture (Last updated December 2020)
- Number-on-the-Forehead Communication--Communication Complexity Reading Group lecture (Last updated December 2020)
- Representations of Monotone Boolean Functions by Linear Programs (Last updated November 2020). Forgive the poor handwriting on this one!
- Derandomization of BPP Using Hitting Set Generators (Last updated April 2020)
- Dehn-Somerville Relations and Positroids (Last updated December 2018)
- Combinatorial Solutions: Extremal Combinatorics and its Applications (Last updated December 2017)

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

- ENNUI - Elegant Neural Network User Interface (Released open source)

- Developed with Jesse Michel and Zack Holbrook

- Mentored by Gilbert Strang and Hendrik Strobelt

- Used in MIT courses 18.06 and 18.065

Github

My CV

Seminars:

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

Seminars:

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

## Comments

## Post a Comment