M. Stoeckl

Interests

Papers

Conference:

• "Adversarially robust coloring for graph streams", with P. Ghosh and A. Chakrabarti. Full version on arXiv. PDF. Poster for a more general audience. Presentation slides.
• "Streaming algorithms for the Missing Item Finding problem". Full version on arXiv. PDF. Presentation slides.
• "Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms", with S. Assadi, A. Chakrabarti, P. Ghosh. PDF. Poster. Presentation slides.

Preprint:

• "The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries", with A. Chakrabarti. PDF.
• "Low-Memory Algorithms for Online and W-Streaming Edge Coloring", with P. Ghosh. Poster.
• "When a random tape is not enough: lower bounds for a problem in adversarially robust streaming", with A. Chakrabarti. PDF.

Unpublished:

• "On the parallel query complexity of pebbling formulas on pyramid graphs." PDF.
• "Lecture notes on the proof of the (improved) sunflower lemma." PDF.
• Lecture notes for a more accessible HyperLogLog analysis (PDF).

Thesis: Presentation slides (PDF).

Older work: 10.1016/j.nima.2019.04.046 (PDF) and 10.1063/1.5016292 (PDF).

Notes

Math honors paper on the distinct distance problem. Some intermediate work. Interesting figures. A prime-dimensional box problem construction.

GSOC 2019 blog/notes.

My research notes are available at "notes/research/research_notesXX.html", where XX is replaced by a %02d-formatted number.

Code

Waypipe is a transparent proxy for Wayland applications, which enables workflows similar to ssh -X.

I also have some projects on: GitHub, sourcehut.